Abstract
This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this paper, we will put an additional limitation on the derivations licensed in TT-MCTAG. We show that TT-MCTAG with this additional limitation can be transformed into equivalent simple RCGs. This result is interesting for theoretical reasons (since it shows that TT-MCTAG in this limited form is mildly context-sensitive) and, furthermore, even for practical reasons: We use the proposed transformation from TT-MCTAG to RCG in an actual parser that we have implemented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Joshi, A.K., Schabes, Y.: Tree-Adjoning Grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 69–123. Springer, Berlin (1997)
Boullier, P.: On TAG Parsing. In: TALN 1999, 6e conférence annuelle sur le Traitement Automatique des Langues Naturelles, Cargèse, Corse, pp. 75–84 (1999)
Boullier, P.: Range Concatenation Grammars. In: Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), Trento, Italy, pp. 53–64 (2000)
Weir, D.J.: Characterizing mildly context-sensitive grammar formalisms. PhD thesis, University of Pennsylvania (1988)
Boullier, P.: A Proposal for a Natural Language Processing Syntactic Backbone. Technical Report 3342, INRIA (1998)
Joshi, A.K.: Tree adjoining grammars: How much contextsensitivity is required ro provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206–250. Cambridge University Press, Cambridge (1985)
Boullier, P.: A Generalization of Mildly Context-Sensitive Formalisms. In: Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+4), University of Pennsylvania, Philadelphia, pp. 17–20 (1998)
Lichte, T.: An MCTAG with Tuples for Coherent Constructions in German. In: Proceedings of the 12th Conference on Formal Grammar 2007, Dublin, Ireland (2007)
Kallmeyer, L.: Tree-local multicomponent tree adjoining grammars with shared nodes. Computational Linguistics 31(2), 187–225 (2005)
Søgaard, A., Lichte, T., Maier, W.: The complexity of linguistically motivated extensions of tree-adjoining grammar. In: Recent Advances in Natural Language Processing 2007, Borovets, Bulgaria (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kallmeyer, L., Parmentier, Y. (2008). On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG). In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)