Abstract
This paper studies the relaxation of word-order, using dependency grammars (DG’s). We study ‘relax-ability of languages (and DG’s)’ based on the notion of DR-(non)projectivity. We obtain two infinite scales of classes of languages using different degrees of relaxation. The one scale contains the class of context-free languages as its first (minimal) element, the other one starts by the class of regular 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.
Similar content being viewed by others
References
J.Dassow, G.Păun: Regulated Rewriting in Formal Language Theory, Akademie-Verlag Berlin, 1989
A.V. Gladkij: Formal’nye grammatiki i jazyki, Iz.: NAUKA, Moskva, 1973
S.A. Greibach, J.E. Hoperoft: Scattered context grammars, JCSS 3 (1969) 233–247.
T.Holan, V.Kubon, M.Plâtek: An Implementation of Syntactic Analysis of Czech, in: Proceedings of IWPT’ 95, Charles University Prague, 1995, pp. 126–135
T.Holan, V.Kubon, M.Plâtek: A Prototype of a Grammar Checker for Czech, Proceedings of the Fifth Conference on Applied Natural Language Processing, ed. Association for Computational Linguistics, Washington, March 1997, pp. 147–154
T. Holan, V.Kubon, K.Oliva, M.Plé,tek: “Two Useful Measures of Word Order Complexity”, in Proceedings of the Coling ‘88 Workshop “Processing of Dependency-Based Grammars”, A. Polguere and S. Kahane (eds.), University of Montreal, Montreal, 1998
A.K. Joshi, and Y.Shabes: Tree-Adjoining Grammars, in Handbook of Formal Languages, Vol 3, G. Rosenberg and A. Salomaa (eds.), Berlin and Heidelberg: Springer, 1997, pp. 69–123
J.Kunze: Die Auslassbarkeit von Satzteilen bei koordinativen Verbindungen im Deutschen, Berlin: Akademie-Verlag, 1972
J.Kunze: Abhängigskeitsgrammatik, Berlin: Akademie-Verlag, 1975
S.Marcus, S.: “Sur la notion de projectivité”, in Zeitschrift fur mathematische Logik and Grundlagen der Mathematik XI,1965, pp. 181–192.
A. Meduna: Syntactic complexity of scattered context grammars, Acta Informatica 32 (1995) 285–298.
A. Nasr: A Formalism and a Parser for Lexicalized Dependency Grammars, in: Proceedings of IWPT’ 95, Charles University Prague, 1995, pp. 186–195
M.Pli tek, T.Holan, V.Kubon: On Relax-ability of Word-Order by D-grammars, Tech. Report TR-2001–01, MFF UK, Praha, 2001
P.Sgall, E. Hajil ova, J. Panevovâ: The Meaning of the Sentence in Its Semantic and Pragmatic Aspects, Dordrecht: Reidel and Prague: Academia, 1986
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London Limited
About this paper
Cite this paper
Plátek, M., Holan, T., Kuboň, V. (2001). On Relax-ability of Word-Order by D-grammars. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds) Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0717-0_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0717-0_14
Publisher Name: Springer, London
Print ISBN: 978-1-85233-526-7
Online ISBN: 978-1-4471-0717-0
eBook Packages: Springer Book Archive