On building a more efficient grammar by exploiting types
Natural Language Engineering
An algebra for semantic construction in constraint-based grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Wide-coverage semantic representations from a CCG parser
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Computational Linguistics
A logic of semantic representations for shallow parsing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Modular graph rewriting to compute semantics
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Markov logic networks for situated incremental natural language understanding
SIGDIAL '12 Proceedings of the 13th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Empirical methods for the study of denotation in nominalizations in spanish
Computational Linguistics
Situated incremental natural language understanding using Markov Logic Networks
Computer Speech and Language
| Hi-index | 0.00 |
We discuss semantic composition in Minimal Recursion Semantics (MRS) and Robust Minimal Recursion Semantics (RMRS). We demonstrate that a previously defined formal algebra applies to grammar engineering across a much greater range of frameworks than was originally envisaged. We show how this algebra can be adapted to composition in grammar frameworks where a lexicon is not assumed, and how this underlies a practical implementation of semantic construction for the RASP system.