Which Linguist Invented the Lightbulb? Presupposition Verification for Question-Answering
Najoung Kim, Ellie Pavlick, Burcu Karagol Ayan, Deepak Ramachandran
Abstract
Many Question-Answering (QA) datasets contain unanswerable questions, but their treatment in QA systems remains primitive. Our analysis of the Natural Questions (Kwiatkowski et al., 2019) dataset reveals that a substantial portion of unanswerable questions (∼21%) can be explained based on the presence of unverifiable presuppositions. Through a user preference study, we demonstrate that the oracle behavior of our proposed system-which provides responses based on presupposition failure-is preferred over the oracle behavior of existing QA systems. Then, we present a novel framework for implementing such a system in three steps: presupposition generation, presupposition verification, and explanation generation, reporting progress on each. Finally, we show that a simple modification of adding presuppositions and their verifiability to the input of a competitive end-to-end QA system yields modest gains in QA performance and unanswerability detection, demonstrating the promise of our approach.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 86eeee5e-0ca5-4908-b106-07bc2b12a214Cited by top-tier papers18
- How Language Model Hallucinations Can SnowballMuru Zhang, Ofir Press, William Merrill, Alisa Liu et al.ICML 2024 · 406 citations
- The Goldilocks of Pragmatic Understanding: Fine-Tuning Strategy Matters for Implicature Resolution by LLMsLaura Ruis, Akbir Khan, Stella Biderman, Sara Hooker et al.NeurIPS 2023 · 87 citations
- FaVIQ: FAct Verification from Information-seeking QuestionsJungsoo Park, Sewon Min, Jaewoo Kang, Luke Zettlemoyer et al.ACL 2022 · 47 citations
- Measuring Chain of Thought Faithfulness by Unlearning Reasoning StepsMartin Tutek, Fateme Hashemi Chaleshtori, Ana Marasovic, Yonatan BelinkovEMNLP 2025 · 37 citations
- How Do We Answer Complex Questions: Discourse Structure of Long-form AnswersFangyuan Xu, Junyi Jessy Li, Eunsol ChoiACL 2022 · 25 citations
Builds on8
- ALBERT: A Lite BERT for Self-supervised Learning of Language RepresentationsZhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel et al.ICLR 2020 · 7,418 citations
- ETC: Encoding Long and Structured Inputs in TransformersJoshua Ainslie, Santiago Ontañón, Chris Alberti, Vaclav Cvicek et al.EMNLP 2020 · 268 citations
- Retrospective Reader for Machine Reading ComprehensionZhuosheng Zhang, Junjie Yang, Hai ZhaoAAAI 2021 · 237 citations
- Dense Passage Retrieval for Open-Domain Question AnsweringVladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis et al.EMNLP 2020 · 142 citations
- NeurQuRI: Neural Question Requirement Inspector for Answerability Prediction in Machine Reading ComprehensionSeohyun Back, Sai Chetan Chinthakindi, Akhil Kedia, Haejun Lee et al.ICLR 2020 · 23 citations
Related papers
- (QA)²: Question Answering with Questionable AssumptionsNajoung Kim, Phu Mon Htut, Samuel R. Bowman, Jackson PettyACL 2023 · 2 citations
- CREPE: Open-Domain Question Answering with False PresuppositionsXinyan Yu, Sewon Min, Luke Zettlemoyer, Hannaneh HajishirziACL 2023 · 13 citations
- DisentQA: Disentangling Parametric and Contextual Knowledge with Counterfactual Question AnsweringElla Neeman, Roee Aharoni, Or Honovich, Leshem Choshen et al.ACL 2023 · 20 citations
- RetinaQA: A Robust Knowledge Base Question Answering Model for both Answerable and Unanswerable QuestionsPrayushi Faldu, Indrajit Bhattacharya, MausamACL 2024 · 2 citations
- IfQA: A Dataset for Open-domain Question Answering under Counterfactual PresuppositionsWenhao Yu, Meng Jiang, Peter Clark, Ashish SabharwalEMNLP 2023 · 6 citations
