Skip to main content

Maximum Entropy Model for Disambiguation of Rich Morphological Tags

  • Conference paper
Systems and Frameworks for Computational Morphology (SFCM 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 100))

Abstract

In this work we describe a statistical morphological tagger for Latvian, Lithuanian and Estonian languages based on morphological tag disambiguation. These languages have rich tagsets and very high rates of morphological ambiguity. We model distribution of possible tags with an exponential probabilistic model, which allows to select and use features from surrounding context. Results show significant improvement in error rates over the baseline, the same as the results for Czech. In comparison with the simplified parameter estimation method applied for Czech, we show that maximum entropy weight estimation achieves considerably better results.

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

Access this chapter

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. Berger, A., Della Pietra, S., Della Pietra, V.: A Maximum Entropy Approach to Natural Language Processing. Computational Linguistics 22(1), 39–71 (1996)

    Google Scholar 

  2. Hajič, J., Vidová-Hladká, B.: Tagging Inflective Languages: Prediction of Morphological Categories for a Rich, Structured Tagset. In: Proceedings of the COLING-ACL Conference, Montreal, Canada, pp. 483–490 (1998)

    Google Scholar 

  3. Halácsy, P., Kornai, A., Oravec, C.: HunPos — an Open Source Trigram Tagger. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics Companion Volume Proceedings of the Demo and Poster Sessions, pp. 209–212. Association for Computational Linguistics, Prague (2007)

    Google Scholar 

  4. Malouf, R.: A Comparison of Algorithms for Maximum Entropy Parameter Estimation. In: Proceedings of CoNLL 2002, pp. 49–55 (2002)

    Google Scholar 

  5. Benson, S., More, J.: A Limited Memory Variable Metric Method in Subspaces and Bound Constrained Optimization Problems. In: Technical Report ANL/MCS-P909-0901, Argonne National Laboratory (2001)

    Google Scholar 

  6. Kaalep, H.-J.: An Estonian Morphological Analyser and the Impact of a Corpus on its Development. Computers and Humanities 31, 115–133 (1997)

    Article  Google Scholar 

  7. MULTEXT-East: Multilingual Text Tools and Corpora for Central and Eastern European Languages, http://nl.ijs.si/ME/

  8. A Simple C++ Library for Maximum Entropy Classification, http://www-tsujii.is.s.u-tokyo.ac.jp/~tsuruoka/maxent

  9. Morphologically Disambiguated Estonian Corpus, http://www.cl.ut.ee/korpused/morfkorpus

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinnis, M., Goba, K. (2011). Maximum Entropy Model for Disambiguation of Rich Morphological Tags. In: Mahlow, C., Piotrowski, M. (eds) Systems and Frameworks for Computational Morphology. SFCM 2011. Communications in Computer and Information Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23138-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23138-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23137-7

  • Online ISBN: 978-3-642-23138-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics