The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Gram- mar (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 sig- nificantly 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.
Lexicalization and Generative Power in CCG
SATTA, GIORGIO
2015
Abstract
The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Gram- mar (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 sig- nificantly 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.File | Dimensione | Formato | |
---|---|---|---|
COLI_a_00219.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Accepted (AAM - Author's Accepted Manuscript)
Licenza:
Accesso gratuito
Dimensione
1.51 MB
Formato
Adobe PDF
|
1.51 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.