mlsanityData to 14 Oct 2026

Formal Query Building with Query Structure Prediction for Complex Question Answering over Knowledge Base

arXiv 2109.03614 ↗First posted 8 Sep 2021cs.CLcited by 16

Not on the map. Why?

Abstract (arXiv)

Formal query building is an important part of complex question answering over knowledge bases. It aims to build correct executable queries for questions. Recent methods try to rank candidate queries generated by a state-transition strategy. However, this candidate generation strategy ignores the structure of queries, resulting in a considerable number of noisy queries. In this paper, we propose a new formal query building approach that consists of two stages. In the first stage, we predict the query structure of the question and leverage the structure to constrain the generation of the candidate queries. We propose a novel graph generation framework to handle the structure prediction task and design an encoder-decoder model to predict the argument of the predetermined operation in each generative step. In the second stage, we follow the previous methods to rank the candidate queries. The experimental results show that our formal query building approach outperforms existing methods on complex questions while staying competitive on simple questions.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 8 Sep 2021.

Builds on

10 of 26 references.

References · 10

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2015Pointer Networkscited by 895
  4. 2019Text Generation from Knowledge Graphs with Graph Transformerscited by 122
  5. 2017Improved Neural Relation Detection for Knowledge Base Question Answeringcited by 44
  6. 2019KBQA: Learning Question Answering over QA Corpora and Knowledge Basescited by 44
  7. 2017Universal Semantic Parsingcited by 21
  8. 2018Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphscited by 17
  9. 2016S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linkingcited by 16
  10. 2019Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answeringcited by 15

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 5; 2023: 3; 2024: 3.

16 papers.

Sort:

By area:

  1. 2022Modern Baselines for SPARQL Semantic Parsingcited by 34
  2. 2024Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Modelscited by 25
  3. 2023Prompting Large Language Models with Chain-of-Thought for Few-Shot Knowledge Base Question Generationcited by 21
  4. 2021Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions over Knowledge Graphscited by 16
  5. 2024CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Eracited by 16
  6. 2021A Two-Stage Approach towards Generalization in Knowledge Base Question Answeringcited by 15
  7. 2023Question Decomposition Tree for Answering Complex Questions over Knowledge Basescited by 15
  8. 2022Semantic Structure based Query Graph Prediction for Question Answering over Knowledge Graphcited by 9
  9. 2022Crake: Causal-Enhanced Table-Filler for Question Answering over Large Scale Knowledge Basecited by 8
  10. 2023NuTrea: Neural Tree Search for Context-guided Multi-hop KGQAcited by 7
  11. 2021A Chinese Multi-type Complex Questions Answering Dataset over Wikidatacited by 5
  12. 2024SPARKLE: Enhancing SPARQL Generation with Direct KG Integration in Decodingcited by 5
4 more
  1. 2022Improving Complex Knowledge Base Question Answering via Question-to-Action and Question-to-Question Alignmentcited by 1
  2. 2021Reducing the impact of out of vocabulary words in the translation of natural language questions into SPARQL queriescited by 0
  3. 2021Calculating Question Similarity is Enough: A New Method for KBQA Taskscited by 0
  4. 2022A Method of Query Graph Reranking for Knowledge Base Question Answeringcited by 0