Semantic Parsing with Candidate Expressions for Knowledge Base Question Answering
<|reference_start|>Semantic Parsing with Candidate Expressions for Knowledge Base Question Answering: Semantic parsers convert natural language to logical forms, which can be evaluated on knowledge bases (KBs) to produce denotations. Recent semantic parsers have been developed with sequence-to-sequence (seq2seq) pre-trained language models (PLMs) or large language models, where the models treat logical forms as sequences of tokens. For syntactic and semantic validity, the semantic parsers use grammars that enable constrained decoding. However, the grammars lack the ability to utilize large information of KBs, although logical forms contain representations of KB elements, such as entities or relations. In this work, we propose a grammar augmented with candidate expressions for semantic parsing on a large KB with a seq2seq PLM. The grammar defines actions as production rules, and our semantic parser predicts actions during inference under the constraints by types and candidate expressions. We apply the grammar to knowledge base question answering, where the constraints by candidate expressions assist a semantic parser to generate valid KB elements. In experiments on two benchmarks, KQA Pro and Overnight, the constraints by candidate expressions increased the accuracy of our semantic parser, whether it was trained with strong supervision or weak supervision. Our semantic parser achieved state-of-the-art accuracies on KQA Pro and Overnight.<|reference_end|>
@article{nam2024semantic,
    title={Semantic Parsing with Candidate Expressions for Knowledge Base Question
  Answering},
    author={Daehwan Nam, Gary Geunbae Lee},
    journal={arXiv preprint arXiv:2410.00414},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.00414},
    primaryClass={cs.CL}
}