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. |
Similar Papers
SpanPredict: Extraction of Predictive Document Spans with Neural Attention (2021.naacl-main)
Copied to clipboard
| Challenge: | identifying predictive text in clinical notes can be as important as the predictions themselves . identifying specific content in clinical note descriptions may illuminate previously unknown risk factors . |
| Approach: | They propose a method for identifying predictive text in clinical notes . they use linear attention to formalize the problem as predictive extraction . |
| Outcome: | The proposed model preserves differentiability and allows scalable inference via stochastic gradient descent. |
A Simple and Effective Model for Answering Multi-span Questions (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for reading comprehension restrict output space to a set of single contiguous spans . multi-span questions are problematic because they require multiple inputs - a task that requires a sequence tagging problem . |
| Approach: | They propose a simple architecture for answering multi-span questions by casting the task as a sequence tagging problem. |
| Outcome: | The proposed model significantly improves performance on span extraction questions from DROP and Quoref by 9.9 and 5.5 EM points respectively. |
Improving Span Representation by Efficient Span-Level Attention (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating high-quality span representations are limited by subset of tokens . span-span interactions should play an important role in span encoding, authors argue . |
| Approach: | They propose to introduce span-span interactions and more comprehensive span-token interactions to improve span representations. |
| Outcome: | The proposed model outperforms baseline models on span-related tasks and shows superior performance. |
An Empirical Study on Finding Spans (2022.emnlp-main)
Copied to clipboard
| Challenge: | Various information extraction tasks require a span finding component, which either directly yields the output or serves as an essential component of downstream linking. |
| Approach: | They propose methods for span finding, the selection of consecutive tokens in text for some downstream tasks. |
| Outcome: | The proposed methods perform better on masked language models and pre-trained encoders than on encoder-decoder models. |
Span-ConveRT: Few-shot Span Extraction for Dialog with Pretrained Conversational Representations (2020.acl-main)
Copied to clipboard
| Challenge: | Span-ConveRT is a light-weight model for dialog slot-filling . we show consistent gains over a span extractor and a BERT-based model . |
| Approach: | They propose a model for dialog slot-filling which frames the task as a turn-based span extraction task. |
| Outcome: | The proposed model is especially useful for few-shot learning scenarios. |
Enhanced Language Representation with Label Knowledge for Span Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to extract text spans from plain text do not fully exploit label knowledge. |
| Approach: | They propose a model to integrate label knowledge into text representations by encoding texts and annotations independently and then integrating label knowledge with an elaborate-designed semantics fusion module. |
| Outcome: | The proposed model achieves state-of-the-art performance on four benchmarks and reduces training time and inference time by 76% and 77% on average compared with the existing paradigm. |
A Multi-Type Multi-Span Network for Reading Comprehension that Requires Discrete Reasoning (D19-1)
Copied to clipboard
| Challenge: | Existing models for reading comprehension and question answering do not support discrete reasoning abilities. |
| Approach: | They propose a reading comprehension model that uses a multi-type answer predictor and a multiple-span extraction method to produce one or multiple text spans. |
| Outcome: | The proposed model achieves 79.9 F1 on the DROP hidden test set, creating new state-of-the-art results. |
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. |
Span-Level Model for Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Recent approaches for this span-level task have inherent limitations. |
| Approach: | They propose a model which directly models all possible spans and performs joint entity mention detection and relation extraction. |
| Outcome: | The proposed model performs joint entity mention detection and relation extraction on the ACE2005 dataset. |
Joint Training of Candidate Extraction and Answer Selection for Reading Comprehension (P18-1)
Copied to clipboard
| 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. |