s'authentifier
version française rss feed
inria-00112956, version 1
Voir la fiche détaillée  BibTeX  EndNote  TEI  RefWorks
On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms
Philippe De Groote (, http://www.loria.fr/~degroote/) a1, Sylvain Pogodalla (, http://www.loria.fr/~pogodall/) a1
(2004)
Icone de jolli-final.pdf
Journal of Logic, Language and Information 13, 4 (2004) 421-438
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
Informatique/Informatique et langage
formal language – context-free formalisms – abstract categorial grammar
http://www.springerlink.com/openurl.asp?genre=article&issn=0925-8531&volume=13&issue=4&spage=421
10.1007/s10849-004-2114-x
http://www.springerlink.com/content/1572-9583/