Jump to content

Minimal recursion semantics

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Alvations (talk | contribs) at 12:06, 29 November 2012 (Created page with 'Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed feature structure formalisms s...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]

See also

References

  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