| Challenge: | Recent deep-learning based models suffer from reasoning over long documents and do not trivially generalize to cases where the answer is not present as a span. |
| Approach: | They propose a novel context zoom-in network (ConZNet) that can skip through irrelevant parts of a document and generate an answer using only the relevant regions of text. |
| Outcome: | The proposed architecture outperforms state-of-the-art results by 12.62% (ROUGE-L) relative improvement on the recently proposed and challenging RC dataset ‘NarrativeQA’. |
Similar Papers
MemoReader: Large-Scale Reading Comprehension through Neural Memory Controller (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension are limited in understanding, up to a few paragraphs, failing to comprehend lengthy documents. |
| Approach: | They propose a deep neural network architecture to handle a long-range dependency in RC tasks. |
| Outcome: | The proposed method outperforms existing methods especially for lengthy documents. |
Contextualized Word Representations for Reading Comprehension (N18-2)
Copied to clipboard
| Challenge: | Reading comprehension (RC) is a high-level task in natural language understanding that requires reading a document and answering questions about its content. |
| Approach: | They propose to provide a standard neural network for reading a document and answering a question about its content. |
| Outcome: | The proposed model improves on the competitive SQuAD dataset by providing rich contextualized word representations and allowing it to choose between context-dependent and context-independent representations. |
Recurrent Chunking Mechanisms for Long-Text Machine Reading Comprehension (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension (MRC) on long texts typically chunk text into equally-spaced segments without considering information from other segments. |
| Approach: | They propose to let a model learn to chunk in a more flexible way via reinforcement learning. |
| Outcome: | The proposed model extracts a text span from document and query as answer . previous models can only take a fixed-length (e.g., 512) text as input . |
Learning to Search in Long Documents Using Document Structure (C18-1)
Copied to clipboard
| Challenge: | Reading comprehension models are dominated by recurrent neural networks (RNNs) as documents become longer and questions become complex, sequential reading becomes a significant bottleneck. |
| Approach: | They propose a reading comprehension framework that uses document trees to model an agent that interleaves quick navigation with more expensive answer extraction. |
| Outcome: | The proposed model improves question answering performance compared to existing models and has a strong information-retrieval baseline. |
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)
Copied to clipboard
| Challenge: | Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. |
| Approach: | They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents. |
| Outcome: | The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop. |
Multi-hop Reading Comprehension through Question Decomposition and Rescoring (P19-1)
Copied to clipboard
| Challenge: | Existing systems for multi-hop reading comprehension decompose compositional questions into simpler sub-questions . authors propose a system that learns to break compositional multi- hop questions into simple singlehop sub-question . |
| Approach: | They propose a system that decomposes a compositional question into simpler sub-questions . they propose recast subquestion generation as a span prediction problem . |
| Outcome: | The proposed system generates as effective as human-authored sub-questions using 400 examples . it also provides explainable evidence for its decision making in the form of sub-questions . |
Does Structure Matter? Encoding Documents for Machine Reading Comprehension (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing Transformer-based models for machine reading comprehension treat documents as flat sequences. |
| Approach: | They propose a Transformer-based method that reads a document as tree slices and jointly trains and consults the modules at inference time. |
| Outcome: | The proposed method outperforms several baseline approaches on two datasets from varied domains. |
Machine Reading Comprehension using Case-based Reasoning (2023.findings-emnlp)
Copied to clipboard
Dung Thai, Dhruv Agarwal, Mudit Chaudhary, Wenlong Zhao, Rajarshi Das, Jay-Yoon Lee, Hannaneh Hajishirzi, Manzil Zaheer, Andrew McCallum
| Challenge: | Current state-of-the-art machine readers do not support case-based reasoning . |
| Approach: | They propose a method that extracts a set of similar cases from a nonparametric memory and then predicts an answer by selecting the span in the test context that is most similar to the contextualized representations of answers. |
| Outcome: | The proposed method outperforms baselines on NaturalQuestions and NewsQA by 11.5 and 8.4 EM. |
On Making Reading Comprehension More Comprehensive (D19-58)
Copied to clipboard
| Challenge: | Getting machines to "understand" text is a vast and long-standing problem, made more challenging by the fact that it is not even clear what it means to understand text. |
| Approach: | They propose a question-based approach to machine reading comprehension that uses a natural language question to test a system's comprehension of a passage of text. |
| Outcome: | The proposed questions have surface cues or other biases that allow a model to shortcut the intended reasoning process. |
Multi-Granularity Hierarchical Attention Fusion Networks for Reading Comprehension and Question Answering (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to read comprehension style question answering are limited by the volume of annotated datasets. |
| Approach: | They propose a hierarchical attention network for reading comprehension style question answering . they first encode the question and paragraph with fine-grained language embeddings . then propose fusion approach to fuse information from both global and attended representations based on the hierarchic attention network . |
| Outcome: | The proposed method achieves state-of-the-art on the SQuAD and TriviaQA Wiki leaderboards and two adversarial SQu AD datasets. |