Answering Complex Open-domain Questions Through Iterative Query Generation

被引:0
|
作者
Qi, Peng [1 ]
Lin, Xiaowen [1 ]
Mehr, Leo [1 ]
Wang, Zijian [2 ]
Manning, Christopher D. [1 ]
机构
[1] Stanford Univ, Comp Sci Dept, Stanford, CA 94305 USA
[2] Stanford Univ, Symbol Syst Program, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is challenging for current one-step retrieve-and-read question answering (QA) systems to answer questions like "Which novel by the author of `Armada' will be adapted as a feature film by Steven Spielberg?" because the question seldom contains retrievable clues about the missing entity (here, the author). Answering such a question requires multi-hop reasoning where one must gather information about the missing entity (or facts) to proceed with further reasoning. We present GOLDEN (Gold Entity) Retriever, which iterates between reading context and retrieving more supporting documents to answer open-domain multi-hop questions. Instead of using opaque and computationally expensive neural retrieval models, GOLDEN Retriever generates natural language search queries given the question and available context, and leverages off-the-shelf information retrieval systems to query for missing entities. This allows GOLDEN Retriever to scale up efficiently for open-domain multi-hop reasoning while maintaining interpretability. We evaluate GOLDEN Retriever on the recently proposed open-domain multi-hop QA dataset, HOTPOTQA, and demonstrate that it outperforms the best previously published model despite not using pretrained language models such as BERT.
引用
收藏
页码:2590 / 2602
页数:13
相关论文
共 50 条
  • [1] Answering Any-hop Open-domain Questions with Iterative Document Reranking
    Zhang, Yuyu
    Nie, Ping
    Ramamurthy, Arun
    Song, Le
    SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 481 - 490
  • [2] AMBIGQA: Answering Ambiguous Open-domain Questions
    Min, Sewon
    Michael, Julian
    Hajishirzi, Hannaneh
    Zettlemoyer, Luke
    PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), 2020, : 5783 - 5797
  • [3] Query Context Expansion for Open-Domain Question Answering
    Zhu, Wenhao
    Zhang, Xiaoyu
    Ye, Liang
    Zhai, Qiuhong
    ACM TRANSACTIONS ON ASIAN AND LOW-RESOURCE LANGUAGE INFORMATION PROCESSING, 2023, 22 (08)
  • [4] A Hybrid Text Generation-Based Query Expansion Method for Open-Domain Question Answering
    Zhu, Wenhao
    Zhang, Xiaoyu
    Zhai, Qiuhong
    Liu, Chenyun
    FUTURE INTERNET, 2023, 15 (05)
  • [5] Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering
    Chuang, Yung-Sung
    Fang, Wei
    Li, Shang-Wen
    Yih, Wen-tau
    Glass, James
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2023), 2023, : 12131 - 12147
  • [6] Answering Open-Domain Questions of Varying Reasoning Steps from Text
    Qi, Peng
    Lee, Haejun
    Sido, Oghenetegiri
    Manning, Christopher D.
    2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), 2021, : 3599 - 3614
  • [7] Generation-Augmented Retrieval for Open-Domain Question Answering
    Mao, Yuning
    He, Pengcheng
    Liu, Xiaodong
    Shen, Yelong
    Gao, Jianfeng
    Han, Jiawei
    Chen, Weizhu
    59TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 11TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (ACL-IJCNLP 2021), VOL 1, 2021, : 4089 - 4100
  • [8] Advances in open-domain question answering
    Zhang, Zhi-Chang
    Zhang, Yu
    Liu, Ting
    Li, Sheng
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2009, 37 (05): : 1058 - 1069
  • [9] Type checking in open-domain question answering
    Schlobach, S
    Olsthoorn, M
    de Rijke, M
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 398 - 402
  • [10] Detrimental Contexts in Open-Domain Question Answering
    Oh, Philhoon
    Thorne, James
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (EMNLP 2023), 2023, : 11589 - 11605