Minimal recursion semantics

<p>Minimal recursion semantics (MRS) is a framework for <a href="/facts/Computational_semantics/gbHj755X">computational semantics</a>. It can be implemented in typed <a href="/facts/Feature_structure/1WlbGm88">feature structure</a> formalisms such as <a href="/facts/Head-driven_phrase_structure_grammar/MW1TXsca">head-driven phrase structure grammar</a> and <a href="/facts/Lexical_functional_grammar/UqAfrL1G">lexical functional grammar</a>. It is suitable for computational language <a href="/facts/Parsing/nRKB01S3">parsing</a> and <a href="/facts/Natural_language_generation/qudtLU6Y">natural language generation</a>. MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the <a href="/facts/Principle_of_compositionality/yP2hR4Le">principles of semantic composition</a>. This technique is used in <a href="/facts/Machine_translation/DGF3NwuI">machine translation</a>.
</p><p>Early pioneers of MRS include <a href="/facts/Ann_Copestake/HcomPHfQ">Ann Copestake</a>, Dan Flickinger, <a href="/facts/Carl_Pollard/bg13yt8R">Carl Pollard</a>, and <a href="/facts/Ivan_Sag/Smf8A0v1">Ivan Sag</a>.
</p>

Minimal recursion semantics open-in-new

Minimal recursion semantics