Abstract
Semantic parsing solves knowledge base (KB) question answering (KBQA) by composing a KB query, which generally involves node extraction (NE) and graph composition (GC) to detect and connect related nodes in a query. Despite the strong causal effects between NE and GC, previous works fail to directly model such causalities in their pipeline, hindering the learning of subtask correlations. Also, the sequencegeneration process for GC in previous works induces ambiguity and exposure bias, which further harms accuracy. In this work, we formalize semantic parsing into two stages. In the first stage (graph structure generation), we propose a causal-enhanced table-filler to overcome the issues in sequence-modelling and to learn the internal causalities. In the second stage (relation extraction), an efficient beamsearch algorithm is presented to scale complex queries on large-scale KBs. Experiments on LC-QuAD 1.0 indicate that our method surpasses previous state-of-the-arts by a large margin (17%) while remaining time and space efficiency. The code and models are available at https://github.com/AOZMH/Crake.
Cite
CITATION STYLE
Zhang, M., Zhang, R., Li, Y., & Zou, L. (2022). Crake: Causal-Enhanced Table-Filler for Question Answering over Large Scale Knowledge Base. In Findings of the Association for Computational Linguistics: NAACL 2022 - Findings (pp. 1787–1798). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2022.findings-naacl.136
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.