Advertisement

Some Methods of Describing Discontinuity in Polish and Their Cost-Effectiveness

  • Filip Graliński
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4188)

Abstract

The aim of this paper is to present some methods of handling discontinuity (and freer word order in general) within a medium-level grammatical framework. A context-free formalism and the “backbone” set of rules for verbal phrases are presented as the background for this paper. The main result consists in showing how discontinuous infinitive phrases and discontinuous noun phrases (interrogative phrases included) can be theoretically covered within the introduced formalism and similar grammatical frameworks. The second result reported in this paper is the cost-effectiveness analysis of introducing discontinuity rules into a medium-level grammatical framework: it turns out that attempting to cover some types of discontinuity may be unprofitable within a given grammatical framework. Although only examples from the Polish language are discussed, the described solutions are likely to be relevant for other languages with similar word order properties.

Keywords

Noun Phrase Machine Translation Word Order Tree Operation Syntax Tree 
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.
    Kurcz, I., Lewicki, A., et al.: Słownik frekwencyjny polszczyzny współczesnej (1990)Google Scholar
  2. 2.
    Holan, T., Kuboň, V., et al.: Two Useful Measures of Word Order Complexity. In: COLING 1998 Workshop Processing of Dependency-Based Grammars (1998)Google Scholar
  3. 3.
    Sylvain, K., Nasr, A., Rambow, O.: Pseudo-Projectivity: A Polynomially Parsable Non-Projective Dependency Grammar (1998), http://citeseer.ifi.unizh.ch/586031.html
  4. 4.
    Derwojedowa, M.: Porządek linearny składników zdania elementarnego w języku polskim. Elipsa, Warszawa (2000)Google Scholar
  5. 5.
    Nasr, A., Rambow, O.: A Simple String-Rewriting Formalism for Dependency Grammar. In: Proceedings of the COLING 1998 Workshop Recent Advances in Dependency Grammar (2004)Google Scholar
  6. 6.
    Graliński, F.: A Simple CF Formalism and Free Word Order. In: Proceedings of the 2nd Language & Technology Conference, pp. 172–176 (2005)Google Scholar
  7. 7.
    Graliński, F.: A Simple CF Formalism and Free Word Order. In: Archives of Control Sciences Lecture Notes in Computer Science, vol. 15, pp. 541–554. Institute of Automatic Control, Silesian University of Technology, Gliwice (2005)Google Scholar
  8. 8.
    Jasssem, K.: Przetwarzanie tekstów polskich w systemie tłumaczenia automatycznego POLENG, Wydawnictwo Naukowe Uniwersytetu im. Adama Mickiewicza, Poznań (in press, 2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Filip Graliński
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoznańPoland

Personalised recommendations