Multi-Component Tree Insertion Grammars

Pierre Boullier 1 Benoît Sagot 1
1 ALPAGE - Analyse Linguistique Profonde à Grande Echelle ; Large-scale deep linguistic processing
Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00616691
Contributor : Benoît Sagot <>
Submitted on : Tuesday, August 23, 2011 - 11:04:27 PM
Last modification on : Friday, January 4, 2019 - 5:33:24 PM
Long-term archiving on : Friday, November 25, 2011 - 12:03:24 PM

File

fg09mctig.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00616691, version 1

Collections

Citation

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

Share

Metrics

Record views

187

Files downloads

653