Quick and (not so) Dirty: Unsupervised Selection of Justification Sentences for Multi-hop Question Answering

被引:0
|
作者
Yadav, Vikas [1 ]
Bethard, Steven [1 ]
Surdeanu, Mihai [1 ]
机构
[1] Univ Arizona, Tucson, AZ 85721 USA
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose an unsupervised strategy for the selection of justification sentences for multihop question answering (QA) that (a) maximizes the relevance of the selected sentences, (b) minimizes the overlap between the selected facts, and (c) maximizes the coverage of both question and answer. This unsupervised sentence selection method can be coupled with any supervised QA approach. We show that the sentences selected by our method improve the performance of a state-of-the-art supervised QA model on two multi-hop QA datasets: AI2's Reasoning Challenge (ARC) and Multi-Sentence Reading Comprehension (MultiRC). We obtain new state-of-the-art performance on both datasets among approaches that do not use external resources for training the QA system: 56.82% F1 on ARC (41.24% on Challenge and 64.49% on Easy) and 26.1% EM0 on MultiRC. Our justification sentences have higher quality than the justifications selected by a strong information retrieval baseline, e.g., by 5.4% F1 in MultiRC. We also show that our unsupervised selection of justification sentences is more stable across domains than a state-of-the-art supervised sentence selection method.
引用
收藏
页码:2578 / 2589
页数:12
相关论文
共 50 条
  • [1] Unsupervised Multi-hop Question Answering by Question Generation
    Pan, Liangming
    Chen, Wenhu
    Xiong, Wenhan
    Kan, Min-Yen
    Wang, William Yang
    2021 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL-HLT 2021), 2021, : 5866 - 5880
  • [2] Multi-hop Question Answering
    Mavi, Vaibhav
    Jangra, Anubhav
    Jatowt, Adam
    FOUNDATIONS AND TRENDS IN INFORMATION RETRIEVAL, 2023, 17 (05): : 457 - 586
  • [3] Generative Context Pair Selection for Multi-hop Question Answering
    Due, Dheeru
    dos Santos, Cicero Nogueira
    Ng, Patrick
    Athiwaratkun, Ben
    Xiang, Bing
    Gardner, Matt
    Singh, Sameer
    2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), 2021, : 7009 - 7015
  • [4] Unsupervised Alignment-based Iterative Evidence Retrieval for Multi-hop Question Answering
    Yadav, Vikas
    Bethard, Steven
    Surdeanu, Mihai
    58TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2020), 2020, : 4514 - 4525
  • [5] Question Calibration and Multi-Hop Modeling for Temporal Question Answering
    Xue, Chao
    Liang, Di
    Wang, Pengfei
    Zhang, Jing
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 17, 2024, : 19332 - 19340
  • [6] Ask to Understand: Question Generation for Multi-hop Question Answering
    Li, Jiawei
    Ren, Mucheng
    Gao, Yang
    Yang, Yizhe
    CHINESE COMPUTATIONAL LINGUISTICS, CCL 2023, 2023, 14232 : 19 - 36
  • [7] Hierarchical Graph Network for Multi-hop Question Answering
    Fang, Yuwei
    Sun, Siqi
    Gan, Zhe
    Pillai, Rohit
    Wang, Shuohang
    Liu, Jingjing
    PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), 2020, : 8823 - 8838
  • [8] Multi-hop question answering using sparse graphs
    Hemmati, Nima
    Ghassem-Sani, Gholamreza
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 126
  • [9] Is Graph Structure Necessary for Multi-hop Question Answering?
    Shao, Nan
    Cui, Yiming
    Liu, Ting
    Wang, Shijin
    Hu, Guoping
    PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), 2020, : 7187 - 7192
  • [10] Repurposing Entailment for Multi-Hop Question Answering Tasks
    Trivedi, Harsh
    Kwon, Heeyoung
    Khot, Tushar
    Sabharwal, Ashish
    Balasubramanian, Niranjan
    2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, 2019, : 2948 - 2958