Abstract
Initially designed to generate languages without rewriting of some nonterminals, contextual grammars are used in formal language theories as well as models for several particular aspects of natural languages. However, despite their power, contextual grammars do not provide a structural description of the generated languages. We present several modalities to add structures to classical contextual grammars. We are studying the relations of these structured contextual languages comparing with other structured languages. Several examples show the potential of the newly introduced grammars.
This work was possible for the first author thanks to the grant 2002CAJAL-BURV4, and for the second author thanks to the grant 1323U07 E30 N-2003BRDI/12-03 both provided by the University Rovira i Virgili.
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
Păun, G.: Marcus Contextual Grammars. Kluwer Academic Publishers, Norwell (1997)
Kudlek, M., Martín-Vide, C., Mateescu, A., Mitrana, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy (26), 703–725 (2002)
Marcus, S., Păun, G., Martín-Vide, C.: Contextual grammars as generative models of natural languages. Comput. Linguist. 24(2), 245–274 (1998)
Kappes, M.: Combining contextual grammars and tree adjoining grammars. Grammars A Journal of Mathematical Research on Formal and Natural Languages 3(2-3), 175–187 (2000)
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Parsing of Series in Automatic Computation, vol. I. Prentice Hall, Englewood Cliffs (1972)
Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69–120. Springer, Heidelberg (1997)
Gécseg, F., Steinby, M.: Tree automata. Akadémiai Kiadó (Publishing House of the Hungarian Academy of Sciences), Budapest (1984)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) (release October 1, 2002), Available on: http://www.grappa.univ-lille3.fr/tata
Hotz, G., Pitsch, G.: On using semi-dyck sets to analyse coupled-context-free languages. Fundam. Inform. 29(1-2), 1–26 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dediu, AH., Martín, G. (2006). Trees as Contexts in Formal Language Generation. In: Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. (eds) Advances in Natural Language Processing. FinTAL 2006. Lecture Notes in Computer Science(), vol 4139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816508_73
Download citation
DOI: https://doi.org/10.1007/11816508_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37334-6
Online ISBN: 978-3-540-37336-0
eBook Packages: Computer ScienceComputer Science (R0)