Revision as of 12:06, 29 November 2012 edit Alvations (talk \| contribs) Extended confirmed users 1,089 edits ←Created page with 'Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed feature structure formalisms s...'		Revision as of 12:09, 29 November 2012 edit undo Alvations (talk \| contribs) Extended confirmed users 1,089 edits No edit summary Next edit →
Line 1: Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed [[Feature_structure\|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]].<ref>Copestake, A., Flickinger, D. P., Sag, I. A., & Pollard, C. (2005). [[lingo.stanford.edu/sag/papers/copestake.pdf\|Minimal Recursion Semantics. An introduction]]. In Research on Language and Computation. 3:281–332</ref>. MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the [[Principle_of_compositionality\|principles of semantic composition]]. ==See also== * [[Computational Semantics]]▼ * [[DELPH-IN]] * [[Head-driven_phrase_structure_grammar]] * [[Lexical-functional grammar]] ▲* [[Computational Semantics]] ==References==

Minimal recursion semantics: Difference between revisions