论文信息 - A Lightweight Stemmer for Gujarati

A Lightweight Stemmer for Gujarati

Gujarati is a resource poor language with almost no language processing tools being available. In this paper we have shown an implementation of a rule based stemmer of Gujarati. We have shown the creation of rules for stemming and the richness in morphology that Gujarati possesses. We have also evaluated our results by verifying it with a human expert.

[1] Martin F. Porter,et al. An algorithm for suffix stripping , 1997, Program.

[2] Tanveer J. Siddiqui,et al. An unsupervised Hindi stemmer with heuristic improvements , 2008, AND '08.

[3] Mathias Creutz,et al. Unsupervised models for morpheme segmentation and morphology learning , 2007, TSLP.

[4] Lemma F. Lessa,et al. Development of Stemming Algorithm for Wolaytta Text , 2003 .

[5] John Goldsmith,et al. An algorithm for the unsupervised learning of morphology , 2006, Natural Language Engineering.

[6] Stephen F. Weiss,et al. Word segmentation by letter successor varieties , 1974, Inf. Storage Retr..

[7] Vincent Ng,et al. Unsupervised morphological parsing of Bengali , 2006, Lang. Resour. Evaluation.

[8] Ananthakrishnan Ramanathan,et al. A Lightweight Stemmer for Hindi , 2003 .

[9] Chris D. Paice,et al. Another stemmer , 1990, SIGF.

[10] Ricardo Baeza-Yates,et al. Information Retrieval: Data Structures and Algorithms , 1992 .

[11] Dayne Freitag,et al. Morphology Induction from Term Clusters , 2005, CoNLL.

[12] Prasenjit Majumder,et al. YASS: Yet another suffix stripper , 2007, TOIS.

[13] Matthew G. Snover,et al. A Bayesian Model for Morpheme and Paradigm Identification , 2001, ACL.

[14] Leah S. Larkey,et al. Hindi CLIR in thirty days , 2003, TALIP.

[15] John A. Goldsmith,et al. Unsupervised Learning of the Morphology of a Natural Language , 2001, CL.