Parsing with an extended domain of locality

4Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.

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.

References Powered by Scopus

A unification algorithm for typed λ-calculus

382Citations
N/AReaders
Get full text

Cited by Powered by Scopus

D-tree substitution grammars

31Citations
N/AReaders
Get full text

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies

3Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Carroll, J., Nicolov, N., Shaumyan, O., Smets, M., & Weir, D. (1999). Parsing with an extended domain of locality. In 9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999 (pp. 217–224). Association for Computational Linguistics (ACL). https://doi.org/10.3115/977035.977080

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 21

66%

Researcher 7

22%

Professor / Associate Prof. 2

6%

Lecturer / Post doc 2

6%

Readers' Discipline

Tooltip

Computer Science 26

76%

Linguistics 5

15%

Social Sciences 2

6%

Neuroscience 1

3%

Save time finding and organizing research with Mendeley

Sign up for free