论文信息 - Evaluation of a Dutch stemming algorithm

Evaluation of a Dutch stemming algorithm

Dans le cadre des etudes sur les systemes de recherche d'information dans des textes neerlandais, les As. decrivent le developpement et l'evaluation d'une technique de lemmatisation appelee detecteur de suffixe (suffix stripping)

Wessel Kraaij | Renée Pohlmann

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

[2] Werkgroep Frequentie-onderzoek van het Nederlands,et al. Woordfrequenties in geschreven en gesproken Nederlands , 1975 .

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

[4] Donna K. Harman,et al. How effective is suffixing? , 1991, J. Am. Soc. Inf. Sci..

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

[6] Peter Willett,et al. The Effectiveness of Stemming for Natural-Language Access to Slovene Textual Data , 1992, J. Am. Soc. Inf. Sci..

[7] Venkata Subramaniam,et al. Information Retrieval: Data Structures & Algorithms , 1992 .

[8] Robert Krovetz,et al. Viewing morphology as an inference process , 1993, Artif. Intell..

[9] Wessel Kraaij,et al. Porter's stemming algorithm for Dutch , 1994 .

[10] Chris D. Paice. An evaluation method for stemming algorithms , 1994, SIGIR '94.

[11] R. H. Baayen,et al. The CELEX Lexical Database (CD-ROM) , 1996 .

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