Advertisement

On Relax-ability of Word-Order by D-grammars

  • Martin Plátek
  • Tomáš Holan
  • Vladislav Kuboň
Conference paper
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

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.

Keywords

Word Order Regular Language Vertical Edge Previous Claim Context Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.Dassow, G.Păun: Regulated Rewriting in Formal Language Theory, Akademie-Verlag Berlin, 1989Google Scholar
  2. 2.
    A.V. Gladkij: Formal’nye grammatiki i jazyki, Iz.: NAUKA, Moskva, 1973Google Scholar
  3. 3.
    S.A. Greibach, J.E. Hoperoft: Scattered context grammars, JCSS 3 (1969) 233–247.MATHGoogle Scholar
  4. 4.
    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–135Google Scholar
  5. 5.
    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–154Google Scholar
  6. 6.
    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, 1998Google Scholar
  7. 7.
    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–123CrossRefGoogle Scholar
  8. 8.
    J.Kunze: Die Auslassbarkeit von Satzteilen bei koordinativen Verbindungen im Deutschen, Berlin: Akademie-Verlag, 1972Google Scholar
  9. 9.
    J.Kunze: Abhängigskeitsgrammatik, Berlin: Akademie-Verlag, 1975Google Scholar
  10. 10.
    S.Marcus, S.: “Sur la notion de projectivité”, in Zeitschrift fur mathematische Logik and Grundlagen der Mathematik XI,1965, pp. 181–192.Google Scholar
  11. 11.
    A. Meduna: Syntactic complexity of scattered context grammars, Acta Informatica 32 (1995) 285–298.MathSciNetMATHGoogle Scholar
  12. 12.
    A. Nasr: A Formalism and a Parser for Lexicalized Dependency Grammars, in: Proceedings of IWPT’ 95, Charles University Prague, 1995, pp. 186–195Google Scholar
  13. 13.
    M.Pli tek, T.Holan, V.Kubon: On Relax-ability of Word-Order by D-grammars, Tech. Report TR-2001–01, MFF UK, Praha, 2001Google Scholar
  14. 14.
    P.Sgall, E. Hajil ova, J. Panevovâ: The Meaning of the Sentence in Its Semantic and Pragmatic Aspects, Dordrecht: Reidel and Prague: Academia, 1986Google Scholar

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • Martin Plátek
    • 1
  • Tomáš Holan
    • 1
  • Vladislav Kuboň
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic

Personalised recommendations