QA Is the New KR: Question-Answer Pairs as Knowledge Bases

• URL: http://arxiv.org/abs/2207.00630v1
• Date: Fri, 1 Jul 2022 19:09:08 GMT
• Title: QA Is the New KR: Question-Answer Pairs as Knowledge Bases
• Authors: Wenhu Chen, William W. Cohen, Michiel De Jong, Nitish Gupta, Alessandro Presta, Pat Verga, John Wieting
• Abstract summary: We argue that the proposed type of KB has many of the key advantages of a traditional symbolic KB. Unlike a traditional KB, this information store is well-aligned with common user information needs.
• Score: 105.692569000534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this position paper, we propose a new approach to generating a type of knowledge base (KB) from text, based on question generation and entity linking. We argue that the proposed type of KB has many of the key advantages of a traditional symbolic KB: in particular, it consists of small modular components, which can be combined compositionally to answer complex queries, including relational queries and queries involving "multi-hop" inferences. However, unlike a traditional KB, this information store is well-aligned with common user information needs.

Related papers

• A Learn-Then-Reason Model Towards Generalization in Knowledge Base Question Answering [17.281005999581865]
  Large-scale knowledge bases (KBs) like Freebase and Wikidata house millions of structured knowledge. Knowledge Base Question Answering (KBQA) provides a user-friendly way to access these valuable KBs via asking natural language questions. This paper develops KBLLaMA, which follows a learn-then-reason framework to inject new KB knowledge into a large language model for flexible end-to-end KBQA.
  arXiv  Detail & Related papers  (2024-06-20T22:22:41Z)
• Two is Better Than One: Answering Complex Questions by Multiple Knowledge Sources with Generalized Links [31.941956320431217]
  We formulate the novel Multi-KB-QA task that leverages the full and partial links among multiple KBs to derive correct answers. We propose a method for Multi-KB-QA that encodes all link relations in the KB embedding to score and rank candidate answers.
  arXiv  Detail & Related papers  (2023-09-11T02:31:41Z)
• Few-shot In-context Learning for Knowledge Base Question Answering [31.73274700847965]
  We propose KB-BINDER, which for the first time enables few-shot in-context learning over KBQA tasks. The experimental results on four public heterogeneous KBQA datasets show that KB-BINDER can achieve a strong performance with only a few in-context demonstrations.
  arXiv  Detail & Related papers  (2023-05-02T19:31:55Z)
• DecAF: Joint Decoding of Answers and Logical Forms for Question Answering over Knowledge Bases [81.19499764899359]
  We propose a novel framework DecAF that jointly generates both logical forms and direct answers. DecAF achieves new state-of-the-art accuracy on WebQSP, FreebaseQA, and GrailQA benchmarks.
  arXiv  Detail & Related papers  (2022-09-30T19:51:52Z)
• Knowledge Base Question Answering by Case-based Reasoning over Subgraphs [81.22050011503933]
  We show that our model answers queries requiring complex reasoning patterns more effectively than existing KG completion algorithms. The proposed model outperforms or performs competitively with state-of-the-art models on several KBQA benchmarks.
  arXiv  Detail & Related papers  (2022-02-22T01:34:35Z)
• SYGMA: System for Generalizable Modular Question Answering OverKnowledge Bases [57.89642289610301]
  We present SYGMA, a modular approach facilitating general-izability across multiple knowledge bases and multiple rea-soning types. We demonstrate effectiveness of our system by evaluating on datasets belonging to two distinct knowledge bases,DBpedia and Wikidata.
  arXiv  Detail & Related papers  (2021-09-28T01:57:56Z)
• A Survey on Complex Question Answering over Knowledge Base: Recent Advances and Challenges [71.4531144086568]
  Question Answering (QA) over Knowledge Base (KB) aims to automatically answer natural language questions. Researchers have shifted their attention from simple questions to complex questions, which require more KB triples and constraint inference.
  arXiv  Detail & Related papers  (2020-07-26T07:13:32Z)
• Faithful Embeddings for Knowledge Base Queries [97.5904298152163]
  deductive closure of an ideal knowledge base (KB) contains exactly the logical queries that the KB can answer. In practice KBs are both incomplete and over-specified, failing to answer some queries that have real-world answers. We show that inserting this new QE module into a neural question-answering system leads to substantial improvements over the state-of-the-art.
  arXiv  Detail & Related papers  (2020-04-07T19:25:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.