Abstract
We introduce and study a natural extension ofMarcus external contextual grammars. This mathematically simple mechanism whichgenerates a proper subclass of simple matrix languages,known to be mildly context-sensitive ones, is still mildlycontext-sensitive. Furthermore, we get an infinite hierarchy ofmildly context-sensitive families of languages.Then we attempt to fill a gap regarding the linguistic relevanceof these mechanisms which consists in defining a tree structure on thestrings generated by many-dimensional external contextual grammars,and investigate some related issues. Several open problemsare finally discussed.
Similar content being viewed by others
REFERENCES
Aho, A. V.: 1968, ‘Indexed Grammars – An Extension of Context-Free Grammars’ , Journal of the ACM 15, 647–671.
Bresnan, J., R. M. Kaplan, S. Peters and A. Zaenen: 1987, ‘Cross-Serial Dependencies in Dutch’ , in W. J. Savitch, E. Bach, W. Marsh and G. Safran-Naveh (eds.), The Formal Complexity of Natural Language, D. Reidel, Dordrecht, pp. 286–319.
Culy, C.: 1987, ‘The Complexity of the Vocabulary of Bambara’ , in W. J. Savitch, E. Bach, W. Marsh and G. Safran-Naveh (eds.), The Formal Complexity of Natural Language, D. Reidel, Dordrecht, pp. 349–357.
Ehrenfeucht, A., G. Rozenberg and Gh. Păun: 1997, ‘Contextual Grammars and Formal Languages’ , in G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 2, Springer Verlag, Berlin, pp. 237–294.
Gazdar, G.: 1985, ‘Applicability of Indexed Grammars to Natural Languages’ , Technical report CSLI-85-34, Center for the Study of Language and Information, Stanford University CA.
Gazdar, G. and G. K. Pullum: 1985, ‘Computationally Relevant Properties of Natural Languages and Their Grammars’ , New Generation Computing 3, 273–306.
Ibarra, O.: 1970, ‘Simple Matrix Languages’ , Information and Control 17, 359–394.
Joshi, A. K.: 1985, ‘How Much Context-Sensitivity is Required to Provide Reasonable Structural Descriptions: Tree Adjoining Grammars’ , in D. Dowty, L. Karttunen and A. Zwicky (eds.), Natural Language Parsing: Psychological, Computational and Theoretical Perspectives, Cambridge University Press, Cambridge, pp. 206–250.
Joshi, A. K., L. S. Levy and M. Takahashi: 1975, ‘Tree Adjunct Grammars’ , Journal of Computer and System Sciences 10(1), 136–163.
Joshi, A. K. and Y. Schabes: 1997, ‘Tree-Adjoining Grammars’ , in G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 3, Springer Verlag, Berlin, pp. 69–123.
Joshi, A. K., K. Vijay-Shanker and D. Weir: 1991, ‘The Convergence of Mildly Context-Sensitive Grammatical Formalisms’ , in P. Sells, S. Shieber and T. Wasow (eds.), Foundational Issues in Natural Language Processing, MIT Press, Cambridge, MA, pp. 31–81.
Manaster Ramer, A.: 1999, ‘Some Uses and Abuses of Mathematics in Linguistics’ , in C. Martín-Vide (ed.), Issues in Mathematical Linguistics, John Benjamins, Amsterdam, pp. 73–130.
Marcus, S.: 1969, ‘Contextual Grammars’ , Revue Roumaine des Mathématiques Pures et Appliquées 14(10), 1525–1534.
Marcus S.: 1997, ‘Contextual Grammars and Natural Languages’ , in G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 2, Springer Verlag, Berlin, pp. 215–236.
Martín-Vide, C. and A. Mateescu: 1999, ‘Sewing Grammars’ , in Gh. Păun and G. Ciobanu (eds.), Fundamentals of Computation Theory, 12th International Symposium FCT’ 99, Lecture Notes in Computer Science 1684, Springer Verlag, Berlin, pp. 398–408.
Martín-Vide, C. and A. Mateescu: 2000a, ‘Contextual Grammars with Trajectories’ , in G. Rozenberg and W. Thomas (eds.), Developments in Language Theory: Foundations, Applications and Perspectives, World Scientific, Singapore, pp. 362–374.
Martín-Vide, C. and A. Mateescu: 2000b, ‘Special Families of Sewing Languages’ , Journal of Automata, Languages and Combinatorics 5(3), 279–286.
Martín-Vide, C. and A. Mateescu: 2001, ‘Sewing Contexts and Mildly Context-Sensitive Languages’ , in C. Martín-Vide and V. Mitrana (eds.), Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Dordrecht, pp. 75–84.
Partee, B. H., A. ter Meulen and R. E. Wall: 1990, Mathematical Methods in Linguistics, Kluwer, Dordrecht.
Pollard, C. J.: 1984, ‘Generalized Phrase Structure Grammars, Head Grammars, and Natural Language’ , PhD dissertation, Stanford University, CA.
Pullum, G. K.: 1985, ‘On Two Recent Attempts to Show That English is Not a CFL, ’Computational Linguistics 10, 182–186.
Pullum, G. K. and G. Gazdar: 1982, ‘Natural Languages and Context-Free Languages’ , Linguistics and Philosophy, 4, 471–504.
Păun, Gh.: 1997, Marcus Contextual Grammars, Kluwer, Dordrecht.
Roach, K.: 1987, ‘Formal Properties of Head Grammars, in A. Manaster Ramer (ed.), Mathematics of Language, John Benjamins, Amsterdam, pp. 293–348.
Rounds, W. C., A. Manaster Ramer and J. Friedman: 1987, ‘Finding Natural Languages a Home in Formal Language Theory’ , in A. Manaster Ramer (ed.), Mathematics of Language, John Benjamins, Amsterdam, pp. 349–360.
Rozenberg, G. and A. Salomaa (eds.): 1997, Handbook of Formal Languages, 3 vols, Springer Verlag, Berlin.
Salomaa, A.: 1973, Formal Languages, Academic Press, New York.
Savitch, W. J., E. Bach, W. Marsh and G. Safran-Naveh (eds.): 1987, The Formal Complexity of Natural Language, D. Reidel, Dordrecht.
Shieber, S. M.: 1987, ‘Evidence Against the Context-Freeness of Natural Languages’ , in W. J. Savitch, E. Bach, W. Marsh and G. Safran-Naveh (eds.), The Formal Complexity of Natural Language, D. Reidel, Dordrecht, pp. 320–334.
Steedman, M.: 1985, ‘Dependency and Coordination in the Grammar of Dutch and English’ , Language 61, 523–568.
Thatcher, J. W.: 1967, ‘Characterizing Derivation Trees of Context-Free Grammars Through a Generalization of Finite Automata Theory’ , Journal of Computer and System Sciences 1, 317–322.
Vijay-Shanker, K. and D. Weir: 1994, ‘The Equivalence of Four Extensions of Context-Free Grammars’ , Mathematical Systems Theory 87, 511–546.
Weir, D.: 1988, ‘Characterizing Mildly Context-Sensitive Grammar Formalisms’ , PhD dissertation, University of Pennsylvania.
Weir, D.: 1992, ‘A Geometric Hierarchy Beyond Context-Free Languages’ , Theoretical Computer Science 104, 235–261.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kudlek, M., Martín-Vide, C., Mateescu, A. et al. Contexts and the Concept of Mild Context-Sensitivity. Linguistics and Philosophy 26, 703–725 (2003). https://doi.org/10.1023/B:LING.0000004545.49963.94
Issue Date:
DOI: https://doi.org/10.1023/B:LING.0000004545.49963.94