<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/diego_ma/HPSG MRS"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/diego_ma/HPSG MRS</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2da2707b95cfe955a6694db6495c6cc5e/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2da2707b95cfe955a6694db6495c6cc5e/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.coli.uni-sb.de/cl/projects/chorus/papers/whque.html"/><swrc:date>Fri Dec 14 02:38:29 CET 2007</swrc:date><swrc:journal>Journal of Semantics</swrc:journal><swrc:pages>37-82</swrc:pages><swrc:title>Wh-questions in Underspecified Minimal Recursion Semantics</swrc:title><swrc:volume>15</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>MRS HPSG underspecification </swrc:keywords><swrc: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.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Markus Egg"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25c63a534951aa868d9726c63a24a6364/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25c63a534951aa868d9726c63a24a6364/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://www-csli.stanford.edu/\~{}sag/sag.html"/><swrc:date>Fri Dec 14 02:37:40 CET 2007</swrc:date><swrc:note>Draft</swrc:note><swrc:title>Minimal Recursion Semantics: an Introduction</swrc:title><swrc:year>1999</swrc:year><swrc:keywords>MRS HPSG underspecification </swrc:keywords><swrc: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.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ann Copestake"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Dan Flickinger"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ivan A. Sag"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Carl Pollard"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26923b67c4ce6ef8d83b2749a46e7665e/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26923b67c4ce6ef8d83b2749a46e7665e/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#TechnicalReport"/><owl:sameAs rdf:resource="http://lingo.stanford.edu/sag/publications.html"/><swrc:date>Fri Dec 14 02:37:39 CET 2007</swrc:date><swrc:address>Stanford, CA</swrc:address><swrc:institution><swrc:Organization swrc:name="CSLI, Stanford University"/></swrc:institution><swrc:title>Minimal Recursion Semantics: an Introduction</swrc:title><swrc:year>1997</swrc:year><swrc:keywords>MRS HPSG underspecification </swrc:keywords><swrc: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.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ann Copestake"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Dan Flickinger"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ivan A. Sag"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
