论文信息 - Semi-automatic stemmer evaluation

Semi-automatic stemmer evaluation

In this paper two stemmers which extract stemming rules from a sample dictionary of transformations are compared. We present their capability to generalize the information in the dictionary. The factors which affect such a generalization are also shown and discussed.

Leo Galambos

[1] David Yarowsky,et al. Minimally Supervised Morphological Analysis by Multimodal Alignment , 2000, ACL.

[2] M. F. Porter,et al. An algorithm for suffix stripping , 1997 .

[3] Julie Beth Lovins,et al. Development of a stemming algorithm , 1968, Mech. Transl. Comput. Linguistics.

[4] Robert Krovetz. Viewing morphology as an inference process , 2000, Artif. Intell..

[5] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[6] Rene De La Briandais. File searching using variable length keys , 1959, IRE-AIEE-ACM Computer Conference.

[7] Eric Brill,et al. A corpus-based approach to language learning , 1993 .

[8] Chris D. Paice,et al. Method for Evaluation of Stemming Algorithms Based on Error Counting , 1996, J. Am. Soc. Inf. Sci..

[9] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.

[10] Donald R. Morrison,et al. PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[11] Leo Galambos,et al. Lemmatizer for Document Information Retrieval Systems in JAVA , 2001, SOFSEM.

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