Abstract
Here we explore an efficient parser for a variant of contextual grammars (CGs) which is available via the internet. Contextual Grammar with context-free selectors allows for a simple representation of many non-context-free phenomena such as the copy language. Up to now, this specific type of selectors has hardly ever been addressed because even for simpler types no efficient parsing algorithms were known. In this paper, we describe a new polynomial parser which is based on the Earley algorithm. Furthermore we illustrate the linguistic relevance of Contextual Grammars with context-free selectors.
Here NPa stands for an accusative noun phrase and NPd for a dative one.
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
Boullier, P.: From Contextual Grammars to Range Concatenation Grammars. Electronical Notes in Theoretical Computer Science, 53 (2001)
Culy, C.: The Complexity of the Vocabulary of Bambara. Linguistics and Philosophy, 8 (1985) 345–351
Earley, J.: An Efficient Context-Free Parsing Algorithm. Communications of the ACM, 13(2) (1970) 94–102
[Ehrenfeucht et al. 1997]_Ehrenfeucht, A., Păun, G., Rozenberg, G.: Contextual Grammars and Natural Languages. In G. Rozenberg and A. Salomaa (eds.) Handbook of Formal Languages, Vol. 2 (Linear Modeling: Background and Application), Springer-Verlag, Berlin Heidelberg, Germany (1997) 237–294
[Ehrenfeucht et al. 1998]_Ehrenfeucht, A., Păun, G., Rozenberg, G.: On representing recursively enumerable languages by internal contextual languages. Theoretical Computer Science, 205 (1998) 61–83
Harbusch, K.: Parsing Contextual Grammars with Linear, Regular and Context-Free Selectors. Procs. of “MOL6-Sixth Meeting on the Mathematics of Language”, Orlando, Florida/USA (1999) 323–335
Harbusch, K.: A Polynomial Parser for Contextual Grammars with Linear, Regular and Context-Free Selectors. In C. Martín-Vide and V. Mitrana (eds). Words, Sequences, Grammars, Languages: Where Biology, Computer Science and Mathematics Meet, Springer, London/UK (2000)
Ilie, L.: The computational complexity of Marcus contextual grammars. Theoretical Computer Science, 183 (1996) 33–44
[Kudlek et al. 1997]_Kudlek, M., Marcus, S., Mateescu, A.: Contextual Grammars with Distributed Catenation and Shuffle. TUCS Technical Report No 103, Turku Centre for Computer Science, Finland (1997)
[Marcus et al. 1998]_Marcus, S., Martín-Vide, C., Păun, G.: Contextual Grammars as Generative Models of Natural Languages. Computational Linguistics, 24(2) (1998) 245–274
Marcus, S.: Contextual Grammars. Revue roumaine des mathématiques pures et appliquées, 14 (1969) 1525–1534
Marcus, S.: Contextual Grammars and Natural Language. In G. Rozenberg and A. Salomaa (eds.). Handbook of Formal Languages, Vol. 2 (Linear Modeling: Background and Application), (1997) 215–235
Martín-Vide, C.: Contextual Automata. Procs. of the Sixth Meeting on Mathematics of Language (1999) 315–321
[Martín-Vide et al. 1995]_Martín-Vide, C., Mateescu, A., Miquel-Vergés, J., Păun, G.: Internal Contextual Grammmars: Minimal, Maximal and Scattered Use of Selectors. Procs. of the Fourth A Bar-Ilan Symposium on Foundations of AI (1995) 132–142
Niemann, G., Otto, F.: Restarting automata, Church-Rosser languages, and confluent contextual grammars. To appear in C. Martín-Vide and V. Mitrana (eds.), Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back, Gordon and Breach, London/UK. (2002)
Păun, G., Nguyen, X. M.: On the inner contextual grammmars. Revue roumaine des mathématiques pures et appliquées, 25 (1980) 641–651
Păun, G.: Marcus Contextual Grammmars. Kluwer, Boston, MA/USA, Dortrecht/NL (1997)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 1 (Word, Language, Grammar), Springer, Berlin/Heidelberg, Germany (1997)
Shieber, S. M.: Evidence against the Context-Freeness of Natural Language. Linguistics and Philosophy, 8 (1985) 333–343
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harbusch, K. (2003). An Efficient Online Parser for Contextual Grammars with at Most Context—Free Selectors. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2003. Lecture Notes in Computer Science, vol 2588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36456-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-36456-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00532-2
Online ISBN: 978-3-540-36456-6
eBook Packages: Springer Book Archive