Parsing with an extended domain of locality
Published 1 January 1999Open access
John M. Carroll, Nicolas Nicolov, Olga Shaumyan, Martine Smets, David Weir
Citations8
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work compares two wide-coverage lexicalized grammars of English, LEXSYS and XTAG, finding that the two grammARS exploit EDOL in different ways.
Abstract
One of the claimed benefits of Tree Adjoining Grammars is that they have an extended domain of locality (EDOL). We consider how this can be exploited to limit the need for feature structure unification during parsing. We compare two wide-coverage lexicalized grammars of English, LEXSYS and XTAG, finding that the two grammars exploit EDOL in different ways.
Keywords
Computer Science
Medical Entomology and ZoologyHead-driven phrase structure grammar
3,973 Citations1994Ivan A. Sag, Carl Pollard
This book presents the most complete exposition of the theory of head-driven phrase structure grammar, introduced in the authors' "Information-Based Syntax and Semantics," and demonstrates the applicability of the HPSG approach to a wide range of empirical problems.
Theoretical Computer ScienceA unification algorithm for typed λ-calculus
509 Citations1975G. Huet
It is shown that the search space for unification of formulas in typed ω -order λ -calculus is significantly smaller than the one for finding the most general unifiers, and its correctness is proved.
ScholarlyCommons (University of Pennsylvania)A Lexicalized Tree Adjoining Grammar for English
313 Citations1990Anne Abeillé, Kathleen Bishop +2 more
A representation of prepositional complements that is based on extended elementary trees, and how to deal with semantic non compositionality in verb-particle combinations, light verb constructions and idioms, without losing the internal syntactic composition of these structures are presented.
Motivations and methods for text simplification
284 Citations1996Raman Chandrasekar, Christine Doran +1 more
This paper considers two alternatives to full parsing which could be used for simplification, one of which uses a Finite State Grammar (FSG) to produce noun and verb groups while the second uses a Supertagging model to produce dependency linkages.
ScholarlyCommons (University of Pennsylvania)Mathematical and computational aspects of lexicalized grammars
178 Citations1990Yves Schabes, Aravind K. Joshi
The view that syntactic rules are not separated from lexical items is explored, and how lexicalized grammars suggest a natural two-step parsing strategy is shown.
Disambiguation of super parts of speech (or supertags)
133 Citations1994Aravind K. Joshi, B. Srinivas
This work presents techniques for disambiguating supertags using local information such as lexical preference and local lexical dependencies, and the performance results for various models of supertag disambIGuation such as unigram, trigram and dependency-based models.
Does Baum-Welch re-estimation help taggers?
129 Citations1994David Elworthy
Two experiments designed to determine how much manual training information is needed for speech tagging by Hidden Markov Model suggest that initial biasing of either lexical or transition probabilities is essential to achieve a good accuracy and reveal three distinct patterns of Baum-Welch reestimation.
CogNIAC
128 Citations1997Breck Baldwin
It is suggested that the system is resolving a sub-set of anaphors that do not require general world knowledge or sophisticated linguistic processing for successful resolution, and is very likely that they are largely domain independent and that they reflect processing strategies used by humans for general language comprehension.
A principle-based hierarchical representation of LTAGs
102 Citations1996Marie-Hélène Candito
This work presents a compact hierarchical organization of syntactic descriptions, that is linguistically motivated and a tool that automatically generates the tree families of an LTAG.
D-tree grammars
98 Citations1995Owen Rambow, K. Vijay‐Shanker +1 more
DTG, unlike TAG, can provide a uniform analysis for wh-movement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.
ScholarlyCommons (University of Pennsylvania)A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
89 Citations1984Hassan Aı̈t-Kaci
A formal lattice-theoretic calculus of partially ordered type structures where the ordering is meant to reflect subtyping is defined and a model of computation which amounts to solving systems of simultaneous equations in a lattice of types is proposed.
A structure-sharing representation for unification-based grammar formalisms
53 Citations1985Fernando C. N. Pereira
The present work is inspired by the structure-sharing method for theorem proving introduced by Boyer and Moore and on the variant of it that is used in some Prolog implementations.
arXiv (Cornell University)Apportioning Development Effort in a Probabilistic LR Parsing System through Evaluation
39 Citations1996John A. Carroll, Ted Briscoe
An implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-ofspeech and punctuation labels coupled with a probabilistic LR parser is described.
Quasi-destructive graph unification
37 Citations1991Hideto Tomabechi
This work has developed a scheme to attain two speed-up elements in the design of unification algorithms: elimination of excessive copying by only copying successful unifications, and finding unification failures as soon as possible.
ArXiv.orgDisambiguation of Super Parts of Speech (or Supertags): Almost Parsing
28 Citations1994Aravind K. Joshi, Srinivas, B.
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
26 Citations1995Roger Evans, Gerald Gazdar +1 more
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules.
arXiv (Cornell University)Developing and Evaluating a Probabilistic LR Parser of Part-of-Speech and Punctuation Labels
26 Citations1995Ted Briscoe, John A. Carroll
The first substantial experiments to assess the contribution of punctuation to deriving an accurate syntactic analysis are reported, by parsing identical texts both with and without naturally-occurring punctuation marks.
Unification with lazy non-redundant copying
24 Citations1991Martin Emele
This paper presents a unification procedure which eliminates the redundant copying of structures by using a lazy incremental copying approach to achieve structure sharing.
Strategic lazy incremental copy graph unification
21 Citations1990Kiyoshi Kogure
The strategic lazy incremental copy graph unification method is a combination of two methods for unifying feature structures based on stochastic data on the likelihood of failure and reduces unnecessary computation, thus increasing the total efficiency of natural language processing systems mainly based on typed feature structure unification.
arXiv (Cornell University)A Lexicalized Tree Adjoining Grammar for English
8 Citations1998XTAG Research Group
Proceedings of the 17th international conference on Computational linguistics -A structure-sharing parser for lexicalized grammars
2 Citations1998Roger G. Evans, David R. Weir