Research on Language and Computation

, Volume 3, Issue 2, pp 281–332

Minimal Recursion Semantics: An Introduction

  • Ann Copestake
  • Dan Flickinger
  • Carl Pollard
  • Ivan A. Sag
Article

DOI: 10.1007/s11168-006-6327-9

Cite this article as:
Copestake, A., Flickinger, D., Pollard, C. et al. Research Language Computation (2005) 3: 281. doi:10.1007/s11168-006-6327-9

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.

Keywords

computational semanticsflat semanticssemantic compositiongrammar implementation

Copyright information

© Springer 2006

Authors and Affiliations

  • Ann Copestake
    • 1
  • Dan Flickinger
    • 2
    • 3
  • Carl Pollard
    • 4
  • Ivan A. Sag
    • 5
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeUK
  2. 2.CSLIStanford UniversityStanfordUSA
  3. 3.Linguistics InstituteUniversity of OsloNorway
  4. 4.Linguistics DepartmentOhio State UniversityColumbusUSA
  5. 5.Department of LinguisticsStanford UniversityStanfordUSA