PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text

被引:0
|
作者
Sun, Haitian [1 ]
Bedrax-Weiss, Tania [1 ]
Cohen, William W. [1 ]
机构
[1] Google Res, Mountain View, CA 94043 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider open-domain question answering (QA) where answers are drawn from either a corpus, a knowledge base (KB), or a combination of both of these. We focus on a setting in which a corpus is supplemented with a large but incomplete KB, and on questions that require non-trivial (e.g., "multi-hop") reasoning. We describe PullNet, an integrated framework for (1) learning what to retrieve and (2) reasoning with this heterogeneous information to find the best answer. PullNet uses an iterative process to construct a question-specific subgraph that contains information relevant to the question. In each iteration, a graph convolutional network (graph CNN) is used to identify subgraph nodes that should be expanded using retrieval (or "pull") operations on the corpus and/or KB. After the subgraph is complete, another graph CNN is used to extract the answer from the subgraph. This retrieve-and-reason process allows us to answer multi-hop questions using large KBs and corpora. PullNet is weakly supervised, requiring question-answer pairs but not gold inference paths. Experimentally PullNet improves over the prior state-ofthe art, and in the setting where a corpus is used with incomplete KB these improvements are often dramatic. PullNet is also often superior to prior systems in a KB-only setting or a text-only setting.
引用
收藏
页码:2380 / 2390
页数:11
相关论文
共 50 条
  • [21] Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering
    Izacard, Gautier
    Grave, Edouard
    16TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (EACL 2021), 2021, : 874 - 880
  • [22] Question Answering on Knowledge Bases and Text using Universal Schema and Memory Networks
    Das, Rajarshi
    Zaheer, Manzil
    Reddy, Siva
    McCallum, Andrew
    PROCEEDINGS OF THE 55TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2017), VOL 2, 2017, : 358 - 365
  • [23] When a Knowledge Base Is Not Enough: Question Answering over Knowledge Bases with External Text Data
    Savenkov, Denis
    Agichtein, Eugene
    SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 235 - 244
  • [24] Knowledge Graph Enabled Open-Domain Conversational Question Answering
    Oduro-Afriyie, Joel
    Jamil, Hasan
    FLEXIBLE QUERY ANSWERING SYSTEMS, FQAS 2023, 2023, 14113 : 63 - 76
  • [25] Span prompt dense passage retrieval for Chinese open domain question answering
    Fan, Chunxiao
    Yan, Zhen
    Wu, Yuexin
    Qian, Bing
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 45 (05) : 7285 - 7295
  • [26] Multi-Hop Paragraph Retrieval for Open-Domain Question Answering
    Feldman, Yair
    El-Yaniv, Ran
    57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), 2019, : 2296 - 2309
  • [27] Research on passage retrieval using domain knowledge in Chinese question answering system
    Han, Lu
    Yu, Zheng-Tao
    Qiu, Yan-Xia
    Meng, Xiang-Yan
    Guo, Jian-Yi
    Si, Sheng-Tao
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 2603 - 2606
  • [28] Advances in open domain question answering
    Thompson, Paul
    COMPUTATIONAL LINGUISTICS, 2007, 33 (04) : 597 - 599
  • [29] Improving the Domain Adaptation of Retrieval Augmented Generation (RAG) Models for Open Domain Question Answering
    Siriwardhana, Shamane
    Weerasekera, Rivindu
    Wen, Elliott
    Kaluarachchi, Tharindu
    Rana, Rajib
    Nanayakkara, Suranga
    TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2023, 11 : 1 - 17
  • [30] True Knowledge: Open-Domain Question Answering Using Structured Knowledge and Inference
    Tunstall-Pedoe, William
    AI MAGAZINE, 2010, 31 (03) : 80 - 92