@techreport{Copestake:1997,
  abstract = {We describe minimal recursion semantics (MRS), a framework for computational semantics which simplifies the design of algorithms. We have integrated an implementation of MRS with an HPSG grammar for both parsing and generation that enables a simple formulation of the grammatical constraints on lexical and phrasal semantics. 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.},
  added-at = {2007-12-14T02:37:39.000+0100},
  address = {Stanford, CA},
  author = {Copestake, Ann and Flickinger, Dan and Sag, Ivan A.},
  biburl = {http://www.bibsonomy.org/bibtex/26923b67c4ce6ef8d83b2749a46e7665e/diego_ma},
  institution = {CSLI, Stanford University},
  interhash = {e61e8570ec9152d5b69a95187c9779f8},
  intrahash = {6923b67c4ce6ef8d83b2749a46e7665e},
  keywords = {MRS HPSG underspecification},
  timestamp = {2007-12-14T02:37:39.000+0100},
  title = {Minimal Recursion Semantics: an Introduction},
  url = {http://lingo.stanford.edu/sag/publications.html},
  year = 1997
}