Skip to main content
SpringerLink
Log in

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata

  • Conference paper
Language and Automata Theory and Applications (LATA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5196))

Abstract

We study proper languages of (strongly) lexicalized FRR-automata, which are a theoretical model for the analysis by reduction that is used in structural analysis of (natural) languages. We obtain two variants of a two-dimensional hierarchy of language classes based on two types of constraints: (1) the number of rewrite operations per cycle, and (2) the number of occurrences of auxiliary symbols (categories) in the sentences (words) of the corresponding characteristic language. The former type of constraints models non-local valences (dependencies), and the latter type models the use of categories during syntactic disambiguation of the sentence being analyzed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Information and Computation 141, 1–36 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Goldstine, J., Kintala, C., Wotschke, D.: On measuring nondeterminism in regular languages. Information and Computation 86, 179–194 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Goldstine, J., Leung, H., Wotschke, D.: Measuring nondeterminism in pushdown automata. Journal of Computer and System Sciences 71, 440–466 (2005); An extended abstract appeared in Reischuk, R., Morvan, M. (eds.) STACS 1997, LNCS, Vol. 1200, pp. 295–306. Springer, Heidelberg (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. Journal of Automata, Languages and Combinatorics 4, 287–311 (1999)

    MATH  MathSciNet  Google Scholar 

  5. Kuboň, V., Plátek, M.: A grammar based aproach to a grammar checking of free word order languages. In: COLING 1994, Kyoto, Japan, vol. II, pp. 906–910 (1994)

    Google Scholar 

  6. Kunze, J.: Abhängigkeitsgrammatik. Studia Grammatica XII. Akademie-Verlag, Berlin (1975)

    Google Scholar 

  7. Lopatková, M., Plátek, M., Kuboň, V.: Modeling syntax of free word-order languages: Dependency analysis by reduction. In: Matoušek, V., Mautner, P., Pavelka, T. (eds.) TSD 2005. LNCS (LNAI), vol. 3658, pp. 140–147. Springer, Heidelberg (2005)

    Google Scholar 

  8. Lopatková, M., Plátek, M., Sgall, P.: Towards a formal model for functional generative description: Analysis by reduction and restarting automata. The Prague Bulletin of Mathematical Linguistics 87, 7–26 (2007)

    Google Scholar 

  9. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Mass., Reading (1982)

    Google Scholar 

  10. Mráz, F., Otto, F., Plátek, M.: Free word order and restarting automata. In: Loos, R., Fazekas, S.Z., Martin-Vide, C. (eds.) LATA 2007, Preproc., Research Group on Math. Linguistics, Universitat Rovira i Virguli, Tarragona, pp. 425–436 (2007)

    Google Scholar 

  11. Mráz, F., Otto, F., Plátek, M.: The Degree of Word-Expansion of Lexicalized RRWW-Automata – A New Measure for The Degree of Nondeterminism of (Context-Free) Languages. Kasseler Informatikschriften (2007)

    Google Scholar 

  12. Mráz, F., Plátek, M., Otto, F.: A measure for the degree of nondeterminism of context-free languages. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 192–202. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Otto, F.: Restarting automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)

    Google Scholar 

  14. Sgall, P., Hajičová, E., Panevová, J.: The Meaning of the Sentence in Its Semantic and Pragmatic Aspects. Reidel Publishing Company, Dordrecht (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, D-34109, Kassel,  

    Friedrich Otto

  2. Faculty of Mathematics and Physics, Department of Computer Science, Charles University, CZ-118 00, Praha 1,  

    Martin Plátek

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Plátek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F., Plátek, M. (2008). A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation