Combinatory Categorial Grammars: generative power and relationship to Linear Context-Free Rewriting Systems

Authors:
David J. Weir;Arvind K. Joshi
Affiliations:
University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA
Venue:
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Year:
1988

Citing 7
Cited 10

Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
A study of tree adjoining grammars

A study of tree adjoining grammars
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Categorial and non-categorial languages

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
The weak generative capacity of parenthesis-free categorial grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics
Tree adjoining and head wrapping

COLING '86 Proceedings of the 11th coference on Computational linguistics

Chinese number-names, tree adjoining languages, and mild context-sensitivity

Computational Linguistics
Parsing some constrained grammar formalisms

Computational Linguistics
New frontiers beyond context-freeness: DI-grammars and DI-automata

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
The formal consequences of using variables in CCG categories

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Treatment of long distance dependencies in LFG and TAG: functional uncertainty in LFG is a corollary in TAG

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Using higher-order logic programming for semantic interpretation of coordinate constructs

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Polynomial time parsing of Combinatory Categorial Grammars

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
The complexity of parsing with extended categorial grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Force deployment analysis with generalized grammar

Information Fusion
The importance of rule restrictions in CCG

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages. We discuss the structural descriptions produced by Combinatory Categorial Grammars and compare them to those of grammar formalisms in the class of Linear Context-Free Rewriting Systems. We also discuss certain extensions of Combinatory Categorial Grammars and their effect on the weak generative capacity.