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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Joshi, A.K.: In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) How much context-sensitivity is necessary for characterizing structural descriptions — Tree Adjoining Grammars. Cambridge University Press, New-York (1985)
Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA (1988)
Joshi, A.K.: An introduction to tree adjoining grammars. In: Manaster-Ramer, A. (ed.) Mathematics of Language, pp. 87–114. John Benjamins, Amsterdam (1987)
Vijay-Shanker, K., Weir, D., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Meeting of the Association for Computational Linguistics (ACL 1987), pp. 104–111. Stanford University, CA (1987)
Boullier, P.: On TAG parsing. Traitement Automatique des Langues (T.A.L.) 41(3), 759–793 (2000)
Boullier, P.: On Multicomponent TAG parsing. In: 6me conference annuelle sur le Traitement Automatique des Langues Naturelles (TALN 1999), Cargse, Corse, France, pp. 321–326 (July 1999); see also Research Report No. 3668 at http://www.inria.fr/RRRT/RR-3668.html , INRIA-Rocquencourt, France, 39 pages (April 1999)
Barthélemy, F., Boullier, P., Deschamp, P., de la Clergerie, É.: Guided parsing of range concatenation languages. In: Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), pp. 42–49. University of Toulouse, France (July 2001)
Schabes, Y., Waters, R.C.: Tree insertion grammar: A cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics 21 (1994)
Joshi, A.K., Levy, L., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences 10, 136–163 (1975)
Boullier, P.: A generalization of mildly context-sensitive formalisms. In: Proceedings of TAG+4, pp. 17–20. University of Pennsylvania, Philadelphia (August 1998)
Boullier, P.: Range Concatenation Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds.) New Developments in Parsing Technology. Text, Speech and Language Technology, vol. 23, pp. 269–289. Kluwer Academic Publishers, Dordrecht (2004)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88, 191–229 (1991)
Boullier, P.: A cubic time extension of context-free grammars. Grammars 3(2/3), 111–131 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boullier, P., Sagot, B. (2011). Multi-Component Tree Insertion Grammars. In: de Groote, P., Egg, M., Kallmeyer, L. (eds) Formal Grammar. FG 2009. Lecture Notes in Computer Science(), vol 5591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20169-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-20169-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20168-4
Online ISBN: 978-3-642-20169-1
eBook Packages: Computer ScienceComputer Science (R0)