Minimal Recursion Semantics: An Introduction

Abstract

Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and that can be implemented in typed feature structure formalisms. We discuss why, in general, a semantic representation with minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may be achieved. MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the principles of semantic composition. We have integrated MRS with a broad-coverage HPSG grammar.

Towards Legal Compliance by Correlating Standards and Laws with a Semi-automated Methodology

“…First, they allow to properly represent the semantics of several linguistic constructions which are hard to represent in other popular formalisms for NLS, such as Discourse Representation Theory (DRT) [23] or Minimal Recursion Semantics (MRS) [9]. Those formalisms introduce complex operators, e.g., modal or causal operators, which take subformulae as an argument.…”

Feature geometry and predictions of locality

“…14 Within the framework of Minimal Recursion Semantics (MRS -see Copestake et al (2005) and Copestake et al (2002)), all the semantic predications of an embedded phrase are present on its relations list, and hence are 'locally visible', just as they are in earlier approaches to semantics within HPSG. Particular levels of embedding would be quite difficult to identify within MRS, where the order of elements on the relations list has no semantic significance.…”

The Hinoki syntactic and semantic treebank of Japanese

“…From this record, all kinds of information can be extracted at various levels of granularity. For example, the semantics are stored in the sign in the form of Minimal Recursion Semantics (Copestake et al 2005). A simplified example of this structural semantic representation (for the definition of doraib" a ''driver'') is given in Fig.…”