Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 132))

  • 1197 Accesses

Abstract

Stemming algorithm is a procedure that attempts to map all the derived forms of a word to a single root, the stem. It is widely used in Information Retrieval applications with the main objective of enhancing the recall factor. Stemmer is also used in various other applications such as summarization, classification and text mining etc. Apart from English, exploration on developing stemmers for both the native and the regional languages are also being carried out. In this paper, we present a stemmer for Tamil, a Dravidian language. Our stemmer effectiveness is 84.79%.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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.

Similar content being viewed by others

References

  1. Kraaij, W., Pohlman, R.: Viewing Stemming as Recall Enhancement. In: The Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 40–48 (1996)

    Google Scholar 

  2. Germann, U.: Building a Statistical Machine Translation System from Scratch: How Much Bang for the Buck Can We Expect? In: ACL 2001 Workshop on Data-Driven Machine Translation, Toulouse, France, July 7 (2001)

    Google Scholar 

  3. Lovins, J.B.: Development of a stemming algorithm. Mechanical Translation and Computational Linguistics 11(1), 22–31 (1968)

    Google Scholar 

  4. Porter, M.F.: An Algorithm for Suffix Stripping. Program 14(3), 130–137 (1980)

    Google Scholar 

  5. Ramanathan, A., Rao, D.: A lightweight stemmer for Hindi. In: The Proceedings of the 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL) for South Asian Languages Workshop (April 2003)

    Google Scholar 

  6. Islam, Z., Uddin, N., Khan, M.: A Light Weight Stemmer for Bengali and Its Use in Spelling Checker. In: Proceedings of 1st International conference on Digital Communications and Computer Applications (DCCA 2007), Irbid, Jordan, pp. 87–93 (2007)

    Google Scholar 

  7. Akram, Q.-U.-A., Naseer, A., Hussain, S.: Assas-Band, an affix-exception-list based Urdu stemmer. In: Proceedings of the 7th Workshop on Asian Language Resources (2009)

    Google Scholar 

  8. Malayalam Stemmer, http://nlp.au-kbc.org/Malayalam_Stemmer_Final.pdf

  9. Kumar, D., Rana, P.: Design and Development of a Stemmer for Punjabi. International Journal of Computer Applications 11(12), 0975–8887 (2010)

    Google Scholar 

  10. Tamil Noun Flow Chart, http://www.au-kbc.org/research_areas/nlp/projects/morph/NounFlowChart.pdf

  11. Tamil Verb Flow Chart, http://www.au-kbc.org/research_areas/nlp/projects/morph/VerbFlowChart.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramachandran, V.A., Krishnamurthi, I. (2012). An Iterative Suffix Stripping Tamil Stemmer. In: Satapathy, S.C., Avadhani, P.S., Abraham, A. (eds) Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) held in Visakhapatnam, India, January 2012. Advances in Intelligent and Soft Computing, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27443-5_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27443-5_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27442-8

  • Online ISBN: 978-3-642-27443-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics