Challenge: Current approaches to the reading comprehension task quantify the relationship between each question and answer choice independently and pick the highest scoring option.
Approach: They propose a method to leverage natural language relations between answer choices to improve machine comprehension.
Outcome: The proposed model improves the performance of a reading comprehension task by leveraging natural language relations between answer choices.

Similar Papers

Using contradictions improves question answering systems (2023.acl-short)

Copied to clipboard

Challenge: Existing systems that use contradiction to determine if a question is supported by background contexts do better than those that use entailment.
Approach: They propose a method that incorporates contradiction in natural language inference (NLI) they propose to reformulate answers from QA systems as hypotheses and then select the best one based on the results.
Outcome: The proposed method improves on multiple choice and extractive QA in two settings.
Multi-choice Relational Reasoning for Machine Reading Comprehension (2020.coling-main)

Copied to clipboard

Challenge: cloze-style reading comprehension is a task that requires much semantic understanding and reasoning using various clues from texts.
Approach: They propose a multi-choice relational reasoning model that emulates human reading comprehension by combining fusion representations of document, query and candidates.
Outcome: The proposed model outperforms baseline models significantly on four datasets.
Enhancing Self-Consistency and Performance of Pre-Trained Language Models through Natural Language Inference (2022.emnlp-main)

Copied to clipboard

Challenge: Existing frameworks for boosting consistency and accuracy of pre-trained NLP models without fine-tuning or re-training are lacking.
Approach: They propose a framework for boosting the consistency and accuracy of pre-trained NLP models using pre-trainer natural language inference models without fine-tuning or re-training.
Outcome: The proposed framework boosts consistency and accuracy of pre-trained NLP models using pre-train natural language inference models without fine-tuning or re-training.
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.
Can NLI Models Verify QA Systems’ Predictions? (2021.findings-emnlp)

Copied to clipboard

Challenge: Recent question answering systems perform well on benchmark datasets, but are not always well-calibrated to spot spurious answers under distribution shifts.
Approach: They propose to use natural language inference to verify whether answers are correct . they leverage large pre-trained models and recent prior datasets to construct powerful question conversion and decontextualization modules.
Outcome: The proposed approach improves the confidence estimation of a QA model across different domains, evaluated in a selective QA setting.
Cross-Pair Text Representations for Answer Sentence Selection (D18-1)

Copied to clipboard

Challenge: Existing approaches to textual entailment and question answering focus on intra-pair similarity . a simple lexical matching (marked with italics) is not enough to learn a model based on intrapair Qto-A similarities.
Approach: They propose to compute scalar products representing similarity between members of different pairs instead of using a single vector for each pair.
Outcome: The proposed approach outperforms more complex models based on neural networks.
Machine Reading Comprehension using Case-based Reasoning (2023.findings-emnlp)

Copied to clipboard

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.
Entity-Relation Extraction as Multi-Turn Question Answering (P19-1)

Copied to clipboard

Challenge: Identifying entities and their relations is the prerequisite of extracting structured knowledge from unstructured raw texts.
Approach: They propose a new paradigm for the task of entity-relation extraction . they cast the task as a multi-turn question answering problem .
Outcome: The proposed paradigm significantly outperforms previous best models on the ACE and CoNLL04 datasets.
Complex Reasoning in Natural Language (2023.acl-tutorials)

Copied to clipboard

Challenge: Recent research shows that pretrained language models are often brittle for complex reasoning tasks.
Approach: They propose to use pre-trained language models to teach machines to reason over texts . they will review recent promising approaches to tackling complex reasoning tasks .
Outcome: This tutorial reviews promising approaches to complex reasoning tasks . it reviews the methods that can be used to augment models with robustness .
Enhancing Answer Boundary Detection for Multilingual Machine Reading Comprehension (2020.acl-main)

Copied to clipboard

Challenge: Existing approaches to improve machine reading comprehension performance on low resource languages are limited due to the lack of sufficient training data.
Approach: They propose to use a mixed MRC task to translate the question to other languages and build cross-lingual question-passage pairs.
Outcome: The proposed task improves on two cross-lingual MRC datasets.

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