On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms

Philippe De Groote 1 Sylvain Pogodalla 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Article dans une revue
Journal of Logic, Language and Information, Springer Verlag, 2004, 13 (4), pp.421-438. <http://www.springerlink.com/content/mj6711up12307380/>. <10.1007/s10849-004-2114-x>
Liste complète des métadonnées

https://hal.inria.fr/inria-00112956
Contributeur : Sylvain Pogodalla <>
Soumis le : lundi 13 novembre 2006 - 17:19:07
Dernière modification le : mardi 25 octobre 2016 - 17:00:07
Document(s) archivé(s) le : mardi 6 avril 2010 - 22:09:33

Identifiants

Collections

Citation

Philippe De Groote, Sylvain Pogodalla. On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms. Journal of Logic, Language and Information, Springer Verlag, 2004, 13 (4), pp.421-438. <http://www.springerlink.com/content/mj6711up12307380/>. <10.1007/s10849-004-2114-x>. <inria-00112956>

Partager

Métriques

Consultations de
la notice

332

Téléchargements du document

172