The reviewed record of science sign in
Pith

arxiv: 2109.03614 · v1 · pith:VCV34GMD · submitted 2021-09-08 · cs.CL

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VCV34GMDrecord.jsonopen to challenge →

classification cs.CL
keywords queriesquerystructurebuildingcandidateformalcomplexgeneration
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.