Abstract
We introduce a neural semantic parser which is interpretable and scalable. Our model converts natural language utterances to intermediate, domain-general natural language representations in the form of predicate-argument structures, which are induced with a transition system and subsequently mapped to target domains. The semantic parser is trained end-to-end using annotated logical forms or their denotations. We achieve the state of the art on SPADES and GRAPHQUESTIONS and obtain competitive results on GEO-QUERY and WEBQUESTIONS. The induced predicate-argument structures shed light on the types of representations useful for semantic parsing and how these are different from linguistically motivated ones.
Cite
CITATION STYLE
Cheng, J., Reddy, S., Saraswat, V., & Lapata, M. (2017). Learning structured natural language representations for semantic parsing. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers) (Vol. 1, pp. 44–55). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/P17-1005
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.