Minimal recursion semantics: Difference between revisions

Revision as of 00:55, 2 November 2023

Latest revision as of 10:33, 25 June 2025

(One intermediate revision by one other user not shown)

Line 1:

{{Short description|Theoretical framework in linguistics}}

'''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]].<ref name=":0">Copestake, A., Flickinger, D. P., Sag, I. A., & Pollard, C. (2005). [https://www.cl.cam.ac.uk/~aac10/papers/mrs.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]]. This technique is used in [[machine translation]].<ref>{{Cite web|title = LogonTop - Deep Linguistic Processing with HPSG|url = http://moin.delph-in.net/LogonTop|website = DELPH-IN|accessdate = 2015-10-13|date = 2013-07-30}}</ref>

Line 17 ⟶ 18:

{{Compu-lingNLP-stub}}

{{semantics-stub}}