BibSonomy publications for /user/diego_ma/HPSGWed Mar 18 07:34:11 CET 2009Proc. ACL 2007624-631HPSG Parsing with Shallow Dependency Constraints2007HPSG parsers We present a novel framework that combines strengths from surface syntactic parsing and deep syntactic parsing to increase deep parsing accuracy, specifically by combining dependency and HPSG parsing. We show that by using surface dependencies to constrain the application of wide-coverage HPSG rules, we can benefit from a number of parsing techniques designed for high-accuracy dependency parsing, while actually performing deep syntactic analysis. Our framework results in a 1.4% absolute improvement over a state-of-the-art approach for wide coverage HPSG parsing.Fri Jan 16 00:52:58 CET 20098 pagesProceedings of IJCNLP-04Corpus-oriented Grammar Development for Acquiring a Head-driven Phrase Structure Grammar from the Penn Treebank2004HPSG parsers This paper describes a method of semi-automatically acquiring an English HPSG grammar from the Penn Treebank. First, heuristic rules are employed to annotate the treebank with partially-specified derivation trees. Lexical entries are automatically extracted from the annotated corpus by inversely applying schemata to partially-specified derivation trees.Fri Dec 14 02:45:08 CET 2007ChicagoHead-Driven Phrase Structure Grammar1994HPSG Fri Dec 14 02:41:29 CET 2007Proc. AI 2001Lecture Notes in Computer Science LNAI 2056Question Answering Using Unification-based Grammar2001question_answering HPSG The problem of Question Answering (QA) as used in TREC can be formulated as follows: Given a collection of natural-language (NL) documents find an answer to given NL query that is a short substring of one of the documents, and it is found in a relevant context. We present a novel approach to the problem based on unification-based grammars for NL.Fri Dec 14 02:39:33 CET 2007www.cogsci.uiuc.edu/\~{}green/See the webpage for updatesElementary Principles of HPSG2000HPSG This chapter describes the theoretical foundations and descriptive mechanisms of Head-Driven Phrase Structure Grammar (HPSG), as well as proposed treatments for a number of familiar grammatical phenomena. The anticipated reader has some familiarity with syntactic phenomena and the function of a theory of syntax, but not necessarily any expertise with modern theories of phrase-structure grammar. Section 1 describes the character of HPSG grammars, and the elements and axioms of the...Fri Dec 14 02:38:57 CET 2007Arbeitspapiere des Sonderforschungsbereichs 340Also available in \myurl{http://xxx.lanl.gov/abs/cmp-lg/9410003}Principle Based Semantics for {HPSG}1994UDRT HPSG The paper presents a constraint based semantic formalism for HPSG. The advantages of the formlism are shown with respect to a grammar for a fragment of German that deals with (i) quantifier scope ambiguities triggered by scrambling and/or movement and (ii) ambiguities that arise from the collective/distributive distinction of plural NPs. The syntax-semantics interface directly implements syntactic conditions on quantifier scoping and distributivity. The construction of semantic representations is guided by general principles governing the interaction between syntax and semantics. Each of these principles acts as a constraint to narrow down the set of possible interpretations of a sentence. Meanings of ambiguous sentences are represented by single partial representations (so-called U(nderspecified) D(iscourse) R(epresentation) S(tructure)s) to which further constraints can be added monotonically to gain more information about the content of a sentence. There is no need to build up a large number of alternative representations of the sentence which are then filtered by subsequent discourse and world knowledge. The advantage of UDRSs is not only that they allow for monotonic incremental interpretation but also that they are equipped with truth conditions and a proof theory that allows for inferences to be drawn directly on structures where quantifier scope is not resolved.Fri Dec 14 02:38:29 CET 2007Journal of Semantics37-82Wh-questions in Underspecified Minimal Recursion Semantics151998MRS HPSG underspecification 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.Fri Dec 14 02:37:40 CET 2007DraftMinimal Recursion Semantics: an Introduction1999MRS HPSG underspecification 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.Fri Dec 14 02:37:39 CET 2007Stanford, CAMinimal Recursion Semantics: an Introduction1997MRS HPSG underspecification 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.Fri Dec 14 02:36:24 CET 2007Linguistics843-863Satisfying Constraints on Extraction and Adjunction271998HPSG constraing_programming In this paper, we present a feature-based theory of complement, adjunct, and subject extraction, in which there is no need either for valence reducing lexical rules or for phonologically null traces. Our analysis rests on the assumption that the mapping between argument structure and valence is defined by realization constraints which are satisfied by all lexical heads. Arguments can be realized as local dependents, in which case they are selected via the head's valence features....