Complex Knowledge Base Question Answering: A Survey

• URL: http://arxiv.org/abs/2108.06688v1
• Date: Sun, 15 Aug 2021 08:14:54 GMT
• Title: Complex Knowledge Base Question Answering: A Survey
• Authors: Yunshi Lan, Gaole He, Jinhao Jiang, Jing Jiang, Wayne Xin Zhao, Ji-Rong Wen
• Abstract summary: Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB) In recent years, researchers propose a large number of novel methods, which looked into the challenges of answering complex questions. We present two mainstream categories of methods for complex KBQA, namely semantic parsing-based (SP-based) methods and information retrieval-based (IR-based) methods.
• Score: 41.680033017518376
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB). Early studies mainly focused on answering simple questions over KBs and achieved great success. However, their performance on complex questions is still far from satisfactory. Therefore, in recent years, researchers propose a large number of novel methods, which looked into the challenges of answering complex questions. In this survey, we review recent advances on KBQA with the focus on solving complex questions, which usually contain multiple subjects, express compound relations, or involve numerical operations. In detail, we begin with introducing the complex KBQA task and relevant background. Then, we describe benchmark datasets for complex KBQA task and introduce the construction process of these datasets. Next, we present two mainstream categories of methods for complex KBQA, namely semantic parsing-based (SP-based) methods and information retrieval-based (IR-based) methods. Specifically, we illustrate their procedures with flow designs and discuss their major differences and similarities. After that, we summarize the challenges that these two categories of methods encounter when answering complex questions, and explicate advanced solutions and techniques used in existing work. Finally, we conclude and discuss several promising directions related to complex KBQA for future research.

Related papers

• Measuring Retrieval Complexity in Question Answering Systems [64.74106622822424]
  Retrieval complexity (RC) is a novel metric conditioned on the completeness of retrieved documents. We propose an unsupervised pipeline to measure RC given an arbitrary retrieval system. Our system can have a major impact on retrieval-based systems.
  arXiv  Detail & Related papers  (2024-06-05T19:30:52Z)
• Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models [7.399563588835834]
  Interactive-KBQA is a framework designed to generate logical forms through direct interaction with knowledge bases (KBs) Our method achieves competitive results on the WebQuestionsSP, ComplexWebQuestions, KQA Pro, and MetaQA datasets.
  arXiv  Detail & Related papers  (2024-02-23T06:32:18Z)
• Knowledge Base Question Answering: A Semantic Parsing Perspective [15.1388686976988]
  Research on question answering over knowledge bases (KBQA) has comparatively been progressing slowly. We identify and attribute this to two unique challenges of KBQA, schema-level complexity and fact-level complexity. We argue that we can still take much inspiration from the literature of semantic parsing.
  arXiv  Detail & Related papers  (2022-09-12T02:56:29Z)
• Modern Question Answering Datasets and Benchmarks: A Survey [5.026863544662493]
  Question Answering (QA) is one of the most important natural language processing (NLP) tasks. It aims using NLP technologies to generate a corresponding answer to a given question based on the massive unstructured corpus. In this paper, we investigate influential QA datasets that have been released in the era of deep learning.
  arXiv  Detail & Related papers  (2022-06-30T05:53:56Z)
• 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 Knowledge Base Question Answering: Methods, Challenges and Solutions [41.680033017518376]
  Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB) We elaborately summarize the typical challenges and solutions for complex KBQA.
  arXiv  Detail & Related papers  (2021-05-25T03:45:30Z)
• 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)
• KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base [67.87878113432723]
  We introduce KQA Pro, a dataset for Complex KBQA including 120K diverse natural language questions. For each question, we provide the corresponding KoPL program and SPARQL query, so that KQA Pro serves for both KBQA and semantic parsing tasks.
  arXiv  Detail & Related papers  (2020-07-08T03:28:04Z)

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.