Minimal recursion semantics

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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]

References

^ ^a ^b 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
^ "LogonTop - Deep Linguistic Processing with HPSG". DELPH-IN. 2013-07-30. Retrieved 2015-10-13.
^ "English Resource Grammar and Lexicon". DELPH-IN. 2013-05-23. Retrieved 2015-10-13.

This computational linguistics-related article is a stub. You can help Wikipedia by expanding it.

This semantics article is a stub. You can help Wikipedia by expanding it.

[:0-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". DELPH-IN. 2013-07-30. Retrieved 2015-10-13.

[3] "English Resource Grammar and Lexicon". DELPH-IN. 2013-05-23. Retrieved 2015-10-13.

[1]

[2]

[3]

See also

References