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
References
- ↑ 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
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computing article is a stub. You can help Wikipedia by expanding it. |
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This semantics article is a stub. You can help Wikipedia by expanding it. |
