Minimal recursion semantics

Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed feature structure formalisms such as head-driven phrase structure grammar and lexical functional grammar. It is suitable for computational language parsing and natural language generation.[1] MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the principles of semantic composition. This technique is used in machine translation.[2] Early pioneers of MRS include Ann Copestake, Dan Flickinger, Carl Pollard, and Ivan Sag.[1][3]

## See also

* DELPH-IN
* Discourse representation theory

## References

1. ↑ 1.0 1.1 Copestake, A., Flickinger, D. P., Sag, I. A., & Pollard, C. (2005). Minimal Recursion Semantics. An introduction. In Research on Language and Computation. 3:281–332
2. ↑ "LogonTop - Deep Linguistic Processing with HPSG". 2013-07-30. http://moin.delph-in.net/LogonTop. Retrieved 2015-10-13.
3. ↑ "English Resource Grammar and Lexicon". 2013-05-23. http://www.delph-in.net/erg/. Retrieved 2015-10-13.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Minimal recursion semantics. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Minimal_recursion_semantics&oldid=253962"