Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.3115/977035.977065 | EACL |
Keywords | Field | DocType |
different way,wide-coverage lexicalized grammar,extended domain,tree adjoining grammars,feature structure unification,tree adjoining grammar | Tree-adjoining grammar,Rule-based machine translation,Locality,L-attributed grammar,S-attributed grammar,Extended Affix Grammar,Computer science,Feature structure,Theoretical computer science,Artificial intelligence,Natural language processing,Parsing | Conference |
Citations | PageRank | References |
7 | 1.60 | 17 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Carroll | 1 | 1971 | 222.19 |
| Nicolas Nicolov | 2 | 400 | 76.27 |
| Olga Shaumyan | 3 | 13 | 3.04 |
| Martine Smets | 4 | 100 | 10.09 |
| David J. Weir | 5 | 840 | 83.84 |