Abstract : In this paper we introduce a new mildly context sensitive formalism called Multi-Component Tree Insertion Grammar. This formalism is a generalization of Tree Insertion Grammars in the same sense that Multi-Component Tree Adjoining Grammars is a generalization of Tree Adjoining Grammars. We show that this class of grammatical formalisms is equivalent to Multi-Component Tree Adjoining Grammars, and that it also defines a hierarchy of languages whose supplementary formal power between two increasing levels is more gently delivered than the one given by Multi-Component Tree Adjoining Grammars. We show that Multi-Component Tree Insertion Grammars and simple Range Concatenation Grammars are equivalent and we show how to transform a grammar of one type into an equivalent grammar of the other type. Such a transformation gives a method to build efficient parsers for Multi-Component Tree Insertion Languages.
Type de document :
Communication dans un congrès
FG 2009 - 14 th Conference on Formal Grammars, 2009, Bordeaux, France. 2009
https://hal.inria.fr/inria-00616691
Contributeur : Benoît Sagot
<>
Soumis le : mardi 23 août 2011 - 23:04:27
Dernière modification le : mardi 17 avril 2018 - 11:29:20
Document(s) archivé(s) le : vendredi 25 novembre 2011 - 12:03:24
