Parsing with an extended domain of locality

Authors:
John Carroll;Nicolas Nicolov;Olga Shaumyan;Martine Smets;David Weir
Affiliations:
University of Sussex, Brighton, UK;University of Sussex, Brighton, UK;University of Sussex, Brighton, UK;University of Sussex, Brighton, UK;University of Sussex, Brighton, UK
Venue:
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Year:
1999

Citing 4
Cited 3

GATE: a general architecture for text engineering

ANLC '97 Proceedings of the fifth conference on Applied natural language processing: Descriptions of system demonstrations and videos
Does Baum-Welch re-estimation help taggers?

ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Motivations and methods for text simplification

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
CogNIAC: high precision coreference with limited knowledge and linguistic resources

ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts

Applied morphological processing of English

Natural Language Engineering
Improving accessibility in an automated question-answering system

ACM SIGACCESS Accessibility and Computing
Collaboratively built semi-structured content and Artificial Intelligence: The story so far

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.