Abstract
In semantic parsing, natural language questions map to meaning representation language (MRL) expressions over some fixed vocabulary of predicates. To do this reliably, one must guarantee that for a wide class of natural language questions (the so called semantically tractable questions), correct interpretations are always in the mapped set of possibilities. Here we demonstrate the system COVER which significantly clarifies, revises and extends the notion of semantic tractability. COVER is written in Python and uses NLTK.
Cite
CITATION STYLE
Minock, M. (2017). COVER: Covering the semantically tractable questions. In 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 - Proceedings of the Software Demonstrations (pp. 1–4). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/e17-3001
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
