Paper: Categorial And Non-Categorial Languages

ACL ID P86-1012
Title Categorial And Non-Categorial Languages
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1986

Computer Science Department Boston University 111 Cummington Street Boston, Massachusetts 02215 USA PREL1MIN A R IES We study the formal and linguistic proper- ties of a class of parenthesis-free categorial grammars derived from those of Ades and Steed- man by varying the set of reduction rules. We characterize the reduction rules capable of gen- erating 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 contem- porary formalisms.