Challenge: Various advanced neural models have been proposed for reading comprehension, but most models ignore its relations with other answer candidates.
Approach: They propose to model reading comprehension as an extract-then-select two-stage procedure . they first extract answer candidates from passages, then select the final answer by combining information from all candidates.
Outcome: The proposed approach improves state-of-the-art performance on open-domain reading comprehension datasets.

Similar Papers

Improving Machine Reading Comprehension with General Reading Strategies (N19-1)

Copied to clipboard

Challenge: Recent studies have shown that reading strategies improve comprehension levels for readers lacking adequate prior knowledge.
Approach: They propose three general strategies to improve machine reading comprehension (MRC) by fine-tuning a pre-trained model with strategies and a target task.
Outcome: The proposed models improve non-extractive machine reading comprehension (MRC) on the largest general domain multiple-choice dataset RACE.
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.
Enhancing Pre-Trained Generative Language Models with Question Attended Span Extraction on Machine Reading Comprehension (2024.emnlp-main)

Copied to clipboard

Challenge: Extractive Machine Reading Comprehension (MRC) is a challenging field in the field of Natural Language Processing.
Approach: They propose a Question-Attended Span Extraction module to address the limitations of generative approaches for extractive machine reading comprehension (MRC) . module significantly enhances performance of pre-trained generative language models, enabling them to surpass the extractive capabilities of advanced Large Language Models (LLMs)
Outcome: The QASE module surpasses state-of-the-art models in few-shot settings.
A Co-Matching Model for Multi-choice Reading Comprehension (P18-2)

Copied to clipboard

Challenge: Existing approaches to machine comprehension are based on pairwise sequence matching, but this approach is not suitable for multi-choice reading comprehension since questions and answers are often equally important.
Approach: They propose a co-matching approach that models whether a passage can match both a question and a candidate answer using a dataset from Chinese exams.
Outcome: The proposed approach achieves state-of-the-art on the RACE dataset from Chinese middle and high school English examinations.
Cross-Task Knowledge Transfer for Query-Based Text Summarization (D19-58)

Copied to clipboard

Challenge: Existing methods for summarization data corpora are limited to extractive and abstractive summarizing.
Approach: They propose to use machine reading comprehension (MRC) and query-based text summarization to produce extractive and abstractive summaries from pre-trained MRC and MT models.
Outcome: The proposed model outperforms existing methods on CNN/Daily Mail and Debatepedia datasets and can be used as a baseline for future systems.
MaP: A Matrix-based Prediction Approach to Improve Span Extraction in Machine Reading Comprehension (2020.aacl-main)

Copied to clipboard

Challenge: Existing methods to predict the start and end positions of answer spans generate two probability vectors.
Approach: They propose a method that extends the probability vector to a probability matrix.
Outcome: The proposed method improves on SQuAD 1.1 and three other question answering benchmarks.
UnitedQA: A Hybrid Approach for Open Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Recent work on open-domain question answering focuses on either extractive or generative readers exclusively.
Approach: They propose a hybrid approach to extractive and generative readers that leverages both models.
Outcome: The proposed approach outperforms state-of-the-art models on NaturalQuestions and TriviaQA respectively.
Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verification (P18-1)

Copied to clipboard

Challenge: Recent years have seen rapid growth in the MRC community . MRC is believed to be a crucial step in building a general intelligent agent .
Approach: They propose an end-to-end neural model that enables multiple passages to verify each other based on their content representations.
Outcome: The proposed model outperforms the baseline on the English MS-MARCO dataset and the Chinese DuReader dataset, and achieves state-of-the-art performance on both datasets.
Training a Ranking Function for Open-Domain Question Answering (N18-4)

Copied to clipboard

Challenge: Recent advances in machine reading have inspired researchers to combine Information Retrieval with machine reading to tackle open-domain QA.
Approach: They propose two neural network rankers that assign scores to different passages based on their likelihood of containing the answer to a given question.
Outcome: The proposed models achieve human level performance in open-domain QA compared to reading comprehension-style QA because it is difficult to retrieve the pieces of paragraphs that contain the answer to the question.
Cut to the Chase: A Context Zoom-in Network for Reading Comprehension (D18-1)

Copied to clipboard

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’.

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