Name
Abstract | ||
|---|---|---|
The weak equivalence of Combinatory Categorial Grammar CCG and Tree-Adjoining Grammar TAG is a central result of the literature on mildly context-sensitive grammar formalisms. However, the categorial formalism for which this equivalence has been established differs significantly from the versions of CCG that are in use today. In particular, it allows restriction of combinatory rules on a per grammar basis, whereas modern CCG assumes a universal set of rules, isolating all cross-linguistic variation in the lexicon. In this article we investigate the formal significance of this difference. Our main result is that lexicalized versions of the classical CCG formalism are strictly less powerful than TAG. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1162/COLI_a_00219 | Computational Linguistics |
Keywords | Field | DocType |
computer and information science | Lexicalization,Computer science,Grammar,Emergent grammar,Equivalence (measure theory),Combinatory categorial grammar,Artificial intelligence,Categorial grammar,Natural language processing,Generative grammar,Mildly context-sensitive grammar formalism | Journal |
Volume | Issue | ISSN |
41 | 2 | 0891-2017 |
Citations | PageRank | References |
5 | 0.43 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Kuhlmann | 1 | 309 | 23.06 |
| Alexander Koller | 2 | 50 | 6.55 |
| Giorgio Satta | 3 | 902 | 90.85 |