The formal consequences of using variables in CCG categories

Authors:
Beryl Hoffman
Affiliations:
University of Pennsylvania, Philadelphia, PA
Venue:
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Year:
1993

Citing 3
Cited 2

Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
A CCG approach to free word order languages

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Combinatory Categorial Grammars: generative power and relationship to Linear Context-Free Rewriting Systems

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

Generative power of CCGs with generalized type-raised categories

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Force deployment analysis with generalized grammar

Information Fusion

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatory Categorial Grammars, CCGs, (Steedman 1985) have been shown by Weir and Joshi (1988) to generate the same class of languages as Tree-Adjoining Grammars (TAG), Head Grammars (HG), and Linear Indexed Grammars (LIG). In this paper, I will discuss the effect of using variables in lexical category assignments in CCGs. It will be shown that using variables in lexical categories can increase the weak generative capacity of CCGs beyond the class of grammars listed above.