Name
Abstract | ||
|---|---|---|
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures
are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch
resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal
is preferable to other previously proposed extensions to TAG, for example D-tree grammars (Rambow et al., 1995), in that it
preserves many of the linguistically desirable aspects of TAG's restrictiveness, specifically concerning the derivation of
locality constraints on unbounded dependencies. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1023/A:1009984504117 | Grammars |
Keywords | Field | DocType |
tree adjoining grammar,long-distance dependencies,c-command | c-command,Tree-adjoining grammar,Rule-based machine translation,Monotonic function,Locality,Computer science,Theoretical computer science,Combinatory categorial grammar,Natural language processing,Artificial intelligence,Formalism (philosophy),Sketch | Journal |
Volume | Issue | ISSN |
3 | 2/3 | 1572-848X |
Citations | PageRank | References |
2 | 0.51 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Frank | 1 | 7 | 4.59 |
| Seth Kulick | 2 | 221 | 29.66 |
| K. Vijay-Shanker | 3 | 2057 | 192.47 |