paper-with-me

Papers

SEMQA: Semi-Extractive Multi-Source Question Answering

2023-11-08 · Tal Schuster, Adam D. Lelkes, Haitian Sun, Jai Gupta, Jonathan Berant, William W. Cohen, Donald Metzler

Recently proposed long-form question answering (QA) systems, supported by large language models (LLMs), have shown promising capabilities. Yet, attributing and verifying their generated abstractive answers can be difficult, and automatically evaluating their accuracy remains an ongoing challenge. In this work, we introduce a new QA task for answering multi-answer questions by summarizing multiple diverse sources in a semi-extractive fashion. Specifically, Semi-extractive Multi-source QA (SEMQA) requires models to output a comprehensive answer, while mixing factual quoted spans -- copied verbatim from given input sources -- and non-factual free-text connectors that glue these spans together into a single cohesive passage. This setting bridges the gap between the outputs of well-grounded but constrained extractive QA systems and more fluent but harder to attribute fully abstractive answers. Particularly, it enables a new mode for language models that leverages their advanced language generation capabilities, while also producing fine in-line attributions by-design that are easy to verify, interpret, and evaluate. To study this task, we create the first dataset of this kind, QuoteSum, with human-written semi-extractive answers to natural and generated questions, and define text-based evaluation metrics. Experimenting with several LLMs in various settings, we find this task to be surprisingly challenging, demonstrating the importance of QuoteSum for developing and studying such consolidation capabilities.

📄 PDF Abstract BibTeX arXiv:2311.04886

Code (2)

google-research-datasets/quotesum 공식 구현
Anirudh-Phukan/verifiability-granular

Tasks

AttributeLong Form Question AnsweringQuestion AnsweringText Generation

Similar Papers 제목 키워드 기반

Summarize-then-Answer: Generating Concise Explanations for Multi-hop Reading Comprehension

2021-09-14 · EMNLP 2021 11 · Naoya Inoue, Harsh Trivedi, Steven Sinha, Niranjan Balasubramanian 외

How can we generate concise explanations for multi-hop Reading Comprehension (RC)? The current strategies of identifying supporting sentences can be seen as an extractive question-focused summarization of the input text.…

2kMulti-Hop Reading ComprehensionReading Comprehension

Plausible Extractive Rationalization through Semi-Supervised Entailment Signal

2024-02-13 · Wei Jie Yeo, Ranjan Satapathy, Erik Cambria

The increasing use of complex and opaque black box models requires the adoption of interpretable measures, one such option is extractive rationalizing models, which serve as a more interpretable alternative. These models…

Natural Language InferenceQuestion Answering

GAAMA 2.0: An Integrated System that Answers Boolean and Extractive Questions

2022-06-16 · Scott McCarley, Mihaela Bornea, Sara Rosenthal, Anthony Ferritto 외

Recent machine reading comprehension datasets include extractive and boolean questions but current approaches do not offer integrated support for answering both question types. We present a multilingual machine reading c…

GPUMachine Reading ComprehensionReading Comprehension

Natural Questions in Icelandic

2022-06-01 · LREC 2022 6 · Vésteinn Snæbjarnarson, Hafsteinn Einarsson

We present the first extractive question answering (QA) dataset for Icelandic, Natural Questions in Icelandic (NQiI). Developing such datasets is important for the development and evaluation of Icelandic QA systems. It a…

Extractive Question-AnsweringNatural QuestionsQuestion Answering

Reinforced Extractive Summarization with Question-Focused Rewards

2018-05-25 · ACL 2018 7 · Kristjan Arumae, Fei Liu

We investigate a new training paradigm for extractive summarization. Traditionally, human abstracts are used to derive goldstandard labels for extraction units. However, the labels are often inaccurate, because human abs…

Extractive Summarizationreinforcement-learningReinforcement LearningReinforcement Learning (RL)