Covering the Semantically Tractable Questions

• Autores: Michael Minock
• Localización: 15th Conference of the European Chapter of the Association for Computational Linguistics: Proceedings of the Software Demonstrations : April 3-7, 2017 Valencia, Spain / Anselmo Peñas Padilla (ed. lit.), André Martins Brandão (ed. lit.), 2017, ISBN 978-1-945626-36-4, págs. 1-4
• Idioma: inglés
• Enlaces
  • Texto Completo Libro (pdf)
• Resumen

  • 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 ques tions), correct interpretations are always in the mapped set of possibilities. Here we demonstrate the system COVER which sig nificantly clarifies, revises and extends the notion of semantic tractability. COVER is written in Python and uses NLTK