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 条
  • [31] Translational relation embeddings for multi-hop knowledge base question answering
    Li, Ziyan
    Wang, Haofen
    Zhang, Wenqiang
    JOURNAL OF WEB SEMANTICS, 2022, 74
  • [32] A question-guided multi-hop reasoning graph network for visual question answering
    Xu, Zhaoyang
    Gu, Jinguang
    Liu, Maofu
    Zhou, Guangyou
    Fu, Haidong
    Qiu, Chen
    INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (02)
  • [33] If You Want to Go Far Go Together: Unsupervised Joint Candidate Evidence Retrieval for Multi-hop Question Answering
    Yadav, Vikas
    Bethard, Steven
    Surdeanu, Mihai
    2021 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL-HLT 2021), 2021, : 4571 - 4581
  • [34] Multi-hop community question answering based on multi-aspect heterogeneous graph
    Wu, Yongliang
    Yin, Hu
    Zhou, Qianqian
    Liu, Dongbo
    Wei, Dan
    Dong, Jiahao
    INFORMATION PROCESSING & MANAGEMENT, 2024, 61 (01)
  • [35] QA4QG: USING QUESTION ANSWERING TO CONSTRAIN MULTI-HOP QUESTION GENERATION
    Su, Dan
    Xu, Peng
    Fung, Pascale
    2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 8232 - 8236
  • [36] Two-Phase Semantic Retrieval for Explainable Multi-Hop Question Answering
    Wang, Qin
    Feng, Jianzhou
    Xu, Ganlin
    Huang, Lei
    NEURAL INFORMATION PROCESSING, ICONIP 2023, PT II, 2024, 14448 : 452 - 465
  • [37] HybridQA: A Dataset of Multi-Hop Question Answering over Tabular and Textual Data
    Chen, Wenhu
    Zha, Hanwen
    Chen, Zhiyu
    Xiong, Wenhan
    Wang, Hong
    Wang, William
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, 2020, : 1026 - 1036
  • [38] Multi-hop knowledge graph question answering based on deformed graph matching
    Li X.
    Fang Q.
    Hu J.
    Qian S.
    Xu C.
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2024, 50 (02): : 529 - 534
  • [39] A dynamic graph expansion network for multi-hop knowledge base question answering
    Wu, Wenqing
    Zhu, Zhenfang
    Qi, Jiangtao
    Wang, Wenling
    Zhang, Guangyuan
    Liu, Peiyu
    NEUROCOMPUTING, 2023, 515 : 37 - 47
  • [40] ELECTRA-based graph network model for multi-hop question answering
    Zhu, Pengxuan
    Yuan, Yuan
    Chen, Lei
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2023, 61 (03) : 819 - 834