Multi-Component Tree Insertion Grammars - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Multi-Component Tree Insertion Grammars

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
fg09mctig.pdf (204.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00616691 , version 1 (23-08-2011)

Identifiers

  • HAL Id : inria-00616691 , version 1

Cite

Pierre Boullier, Benoît Sagot. Multi-Component Tree Insertion Grammars. FG 2009 - 14 th Conference on Formal Grammars, 2009, Bordeaux, France. ⟨inria-00616691⟩
73 View
343 Download

Share

Gmail Facebook Twitter LinkedIn More