Categorial and non-categorial languages

Authors:
Joyce Friedman;Ramarathnam Venkatesan
Affiliations:
Boston University, Boston, Massachusetts;Boston University, Boston, Massachusetts
Venue:
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Year:
1986

Citing 3
Cited 1

Elements of the Theory of Computation

Elements of the Theory of Computation
Parikh-Bounded Languages

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Factoring recursion and dependencies: an aspect of tree adjoining grammars (TAG) and a comparison of some formal properties of TAGs, GPSGs, PLGs, and LPGs

ACL '83 Proceedings of the 21st 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the formal and linguistic properties of a class of parenthesis-free categorial grammars derived from those of Ades and Steedman by varying the set of reduction rules. We characterize the reduction rules capable of generating context-sensitive languages as those having a partial combination rule and a combination rule in the reverse direction. We show that any categorial language is a permutation of some context-free language, thus inheriting properties dependent on symbol counting only. We compare some of their properties with other contemporary formalisms.