Skip to main content
SpringerLink
Log in

Parsing of free-word-order languages

  • Contributed Papers
  • Conference paper
  • First Online:
SOFSEM '95: Theory and Practice of Informatics (SOFSEM 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1012))

  • 136 Accesses

Abstract

This paper introduces a new type of grammars, suitable for parsing of free-word-order (natural) languages. It shows CYK-like algorithms based on such grammars for parsing and introduces a natural restriction on it, to achieve an essential speed-up, and a more adequad parsing for natural languages.

The work on this paper is a part of the joint research project PECO 2824 “Language Technologies for Slavic Languages” supported by EC and of the project ”Automatic checking of grammatical errors in Czech” supported by a grant of the Grant Agency of the Czech Republic No.0475/94.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. A. Harrison: Introduction to Formal Language Theory, Addison-Wesley, 1978

    Google Scholar 

  2. V. Kuboň, M. Plátek: Robust Parsing and Grammar Checking of free Word Order Languages, in Natural Language Parsing: Methods and Formalism eds. K. Sikkel, A. Nijholt, TWLT 6, December 1993, pp. 157–161

    Google Scholar 

  3. V. Kuboň, M. Plátek: A Grammar Based Approach to Grammar Checking of Free Word Order Languages, In: Proceedings COLING 94, Vol.11, Kyoto, August, 1994, pp. 906–910

    Google Scholar 

  4. M. Plátek: The Architecture of a Grammar Checker, In: Proceedings SOFSEM '94, Milovy, 1994, pp. 85–90

    Google Scholar 

  5. N. Sikkel: Parsing Schemata, Proefschrift, Enschede,ISBN 90-9006688-8, 1993

    Google Scholar 

  6. T. Holan, V. Kuboň, M. Plátek: An implementation of a syntactic analysis of Czech, Technical Report No 113. of KKI MFF UK Prague

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software and Computer Science Education Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic

    Tomáš Holan

  2. Institute of Formal and Applied Linguistics Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic

    Vladislav Kuboň

  3. Department of Theoretical Computer Science Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic

    Martin Plátek

Authors
  1. Tomáš Holan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladislav Kuboň
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Plátek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Miroslav Bartosek Jan Staudek Jirí Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holan, T., Kuboň, V., Plátek, M. (1995). Parsing of free-word-order languages. In: Bartosek, M., Staudek, J., Wiedermann, J. (eds) SOFSEM '95: Theory and Practice of Informatics. SOFSEM 1995. Lecture Notes in Computer Science, vol 1012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60609-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-60609-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60609-3

  • Online ISBN: 978-3-540-48463-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation