Semantic Parsing of Ambiguous Input through Paraphrasing and Verification
Philip Arthur, Graham Neubig, Sakriani Sakti, Tomoki Toda, Satoshi Nakamura
Abstract
We propose a new method for semantic parsing of ambiguous and ungrammatical input, such as search queries. We do so by building on an existing semantic parsing framework that uses synchronous context free grammars (SCFG) to jointly model the input sentence and output meaning representation. We generalize this SCFG framework to allow not one, but multiple outputs. Using this formalism, we construct a grammar that takes an ambiguous input string and jointly maps it into both a meaning representation and a natural language paraphrase that is less ambiguous than the original input. This paraphrase can be used to disambiguate the meaning representation via verification using a language model that calculates the probability of each paraphrase.- Anthology ID:
- Q15-1041
- Volume:
- Transactions of the Association for Computational Linguistics, Volume 3
- Month:
- Year:
- 2015
- Address:
- Cambridge, MA
- Venue:
- TACL
- SIG:
- Publisher:
- MIT Press
- Note:
- Pages:
- 571–584
- Language:
- URL:
- https://aclanthology.org/Q15-1041
- DOI:
- 10.1162/tacl_a_00159
- Cite (ACL):
- Philip Arthur, Graham Neubig, Sakriani Sakti, Tomoki Toda, and Satoshi Nakamura. 2015. Semantic Parsing of Ambiguous Input through Paraphrasing and Verification. Transactions of the Association for Computational Linguistics, 3:571–584.
- Cite (Informal):
- Semantic Parsing of Ambiguous Input through Paraphrasing and Verification (Arthur et al., TACL 2015)
- PDF:
- https://preview.aclanthology.org/auto-file-uploads/Q15-1041.pdf