Challenge: Recent advances in reading comprehension have resulted in models that surpass human performance when the answer is contained in a single, continuous passage of text.
Approach: They propose a document-structured message passing architecture for the identification of supporting facts over a graph-structure based representation of text.
Outcome: The proposed model outperforms a baseline reading comprehension test on raw text and shows that it is relevant for multi-hop reasoning.

Similar Papers

Towards Graph-hop Retrieval and Reasoning in Complex Question Answering over Textual Database (2024.lrec-main)

Copied to clipboard

Challenge: Existing benchmarks for textual question answering only focus on single-chain or single-hop retrieval . Existing approaches to answer complex questions have limitations .
Approach: They propose to conduct Graph-Hop, a novel multi-chains and multi-hops retrieval paradigm in complex question answering.
Outcome: The proposed model provides explicit and fine-grained evidence graphs for complex question to support comprehensive and detailed reasoning.
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)

Copied to clipboard

Challenge: Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents.
Approach: They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem.
Outcome: The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders.
Dynamically Fused Graph Network for Multi-hop Reasoning (P19-1)

Copied to clipboard

Challenge: Text-based question answering (TBQA) has been studied extensively in recent years.
Approach: They propose a Dynamically Fused Graph Network to answer questions requiring multiple scattered evidence and reasoning over them.
Outcome: The proposed method achieves competitive results on a public TBQA dataset and produces interpretable reasoning chains.
Hierarchical Graph Network for Multi-hop Question Answering (2020.emnlp-main)

Copied to clipboard

Challenge: Existing multi-hop question answering models focus on multi-level reasoning across multiple documents or paragraphs.
Approach: They propose a hierarchical graph network that aggregates clues from scattered texts . they use a set of contextual encoders to initialize nodes on different levels of granularity .
Outcome: The proposed model outperforms existing multi-hop QA approaches on the HotpotQA benchmark.
Cognitive Graph for Multi-Hop Reading Comprehension at Scale (P19-1)

Copied to clipboard

Challenge: a new framework for multi-hop reading comprehension question answering is needed to cross the chasm of reading comprehension between machine and human.
Approach: They propose a CogQA framework for multi-hop reading comprehension question answering in web-scale documents that builds a cognitive graph in an iterative process by coordinating an implicit extraction module and an explicit reasoning module.
Outcome: The proposed framework outperforms the best competitor in the hotpotQA dataset in F1 . it provides explainable reasoning paths and accurate answers, while giving accurate answers .
Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering (2021.findings-acl)

Copied to clipboard

Challenge: Existing approaches suffer from low confidence when retrieving evidence facts to fill the knowledge gap and lack transparent reasoning process.
Approach: They propose a framework to exploit more valid facts while obtaining explainability for multi-hop question answering at web scale by dynamically constructing a semantic graph and reasoning over it.
Outcome: The proposed framework surpasses existing approaches while maintaining high explainability on OpenBookQA and ARC-Challenge.
Chains-of-Reasoning at TextGraphs 2019 Shared Task: Reasoning over Chains of Facts for Explainable Multi-hop Inference (D19-53)

Copied to clipboard

Challenge: EMNLP 2019 shared task on 'Multi-hop Inference Explanation Regeneration' identifies chains of facts relevant to explain an answer to an elementary science examination question.
Approach: They propose a system that identifies chains of facts relevant to explain an answer to an elementary science examination question.
Outcome: The proposed system outperforms the second best system by 14.95 points on the mean average precision (MAP) metric.
Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps (2020.coling-main)

Copied to clipboard

Challenge: Existing multi-hop question answering datasets do not provide a complete explanation for the reasoning process from the question to the answer.
Approach: They propose a multi-hop question answering dataset that uses structured and unstructured data to test reasoning skills.
Outcome: The proposed dataset ensures multi-hop reasoning while being challenging for multi-models.
WorldTree V2: A Corpus of Science-Domain Structured Explanations and Inference Patterns supporting Multi-Hop Inference (2020.lrec-1)

Copied to clipboard

Challenge: Standardized science questions require combining an average of 6 facts and as many as 16 facts to answer and explain.
Approach: They propose to combine an average of 6 facts and as many as 16 facts to produce an answer for complex questions.
Outcome: The proposed model is based on a corpus of 5,114 standardized science exam questions . it uses multi-fact explanations that combine science knowledge and world knowledge .
Is Graph Structure Necessary for Multi-hop Question Answering? (2020.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on multi-hop question answering across multiple documents or paragraphs.
Approach: They propose a graph neural network to deal with graph structure in textual multi-hop reasoning . they propose 'self-attention' and propose removing entire graph structure may not hurt the final results .
Outcome: The proposed model shows that graph-attention or the entire graph structure can be replaced by self-attention . hotpotQA is a widely used benchmark for multi-hop question answering .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations