@article{Egg:1998,
  abstract = {In this paper, I present Underspecified Minimal Recursion Semantics (UMRS), a representation language that represents structural ambiguities in terms of underspecification. It is argued that this kind of approach allows for transparent semantic representations and a straightforward syntax-semantics interface. UMRS is a semantic metalanguage, whose expressions describe expressions of an object language and (possibly underspecified) dependences between them. The potential of UMRS will be illustrated by employing it as the semantic component of an HPSG description of wh-questions.},
  added-at = {2007-12-14T02:38:29.000+0100},
  author = {Egg, Markus},
  biburl = {http://www.bibsonomy.org/bibtex/2da2707b95cfe955a6694db6495c6cc5e/diego_ma},
  interhash = {3bca2443ef04033aa47e326f83a03480},
  intrahash = {da2707b95cfe955a6694db6495c6cc5e},
  journal = {Journal of Semantics},
  keywords = {MRS HPSG underspecification},
  pages = {37-82},
  timestamp = {2007-12-14T02:38:29.000+0100},
  title = {Wh-questions in Underspecified Minimal Recursion Semantics},
  url = {http://www.coli.uni-sb.de/cl/projects/chorus/papers/whque.html},
  volume = 15,
  year = 1998
}

@misc{Copestake:1999,
  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:40.000+0100},
  author = {Copestake, Ann and Flickinger, Dan and Sag, Ivan A. and Pollard, Carl},
  biburl = {http://www.bibsonomy.org/bibtex/25c63a534951aa868d9726c63a24a6364/diego_ma},
  interhash = {f964d1829b95e5139c7741163c650fdd},
  intrahash = {5c63a534951aa868d9726c63a24a6364},
  keywords = {MRS HPSG underspecification},
  note = {Draft},
  timestamp = {2007-12-14T02:37:40.000+0100},
  title = {Minimal Recursion Semantics: an Introduction},
  url = {http://www-csli.stanford.edu/\~{}sag/sag.html},
  year = 1999
}

@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
}