inria-00112956, version 1
On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms
Philippe De Groote
a, 1Sylvain Pogodalla a, 1
Journal of Logic, Language and Information 13, 4 (2004) 421-438
Résumé : 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.
- a – INRIA
- 1 : CALLIGRAMME (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine
- Domaine : Informatique/Informatique et langage
- Mots-clés : formal language – context-free formalisms – abstract categorial grammar
- Référence interne : http://www.springerlink.com/openurl.asp?genre=article&issn=0925-8531&volume=13&issue=4&spage=421
- Commentaire : http://www.springerlink.com/content/1572-9583/
- inria-00112956, version 1
- http://hal.inria.fr/inria-00112956
- oai:hal.inria.fr:inria-00112956
- Contributeur : Sylvain Pogodalla
- Soumis le : Lundi 13 Novembre 2006, 17:19:07
- Dernière modification le : Lundi 13 Novembre 2006, 20:28:20
Documents associés
Exporter