On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

Authors:
Philippe Groote;Sylvain Pogodalla
Affiliations:
INRIA Lorraine, France 54602;INRIA Lorraine, France 54602
Venue:
Journal of Logic, Language and Information
Year:
2004

Citing 9
Cited 11

Linear logic

Theoretical Computer Science
On multiple context-free grammars

Theoretical Computer Science
Tree-adjoining grammars

Handbook of formal languages, vol. 3
Type-logical semantics

Type-logical semantics
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Grammatical Framework

Journal of Functional Programming
Tree Adjoining Grammars in a fragment of the Lambek calculus

Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Towards abstract categorial grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics

Abstract Families of Abstract Categorial Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizability in the Simply Typed Lambda-Calculus

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

Journal of Logic, Language and Information
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars

Journal of Logic, Language and Information
On two extensions of abstract categorial grammars

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A note on the complexity of abstract categorial grammars

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Distributional learning of abstract categorial grammars

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
The complexity and generative capacity of lexicalized abstract categorial grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
About Parallel and Syntactocentric Formalisms: A Perspective from the Encoding of Convergent Grammar into Abstract Categorial Grammar

Fundamenta Informaticae - Logic, Language, Information and Computation
Controlling extraction in abstract categorial grammars

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of linear context-free rewriting systems. This suggest the possibility of defining an Abstract Categorial Hierarchy.