A stemming algorithm for latin text databases

Journal of Documentation

Volumn 52, Issue 2, 1996, Pages 172-187

  Schinke, Robyn ^a   Greengrass, Mark ^a   Robertson, Alexander M ^a   Willett, Peter ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343422289     PISSN: 00220418     EISSN: None     Source Type: Journal    
DOI: 10.1108/eb026966     Document Type: Article

References (19)

1. LOVINS, J.B. Development of a stemming algorithm. Mechanical Translation and Computational Linguistics, 11, 1968, 22-31.
2. LENNON, M., PIERCE, D.S., TARRY, B.D. and WILLETT, P. An evaluation of some conflation algorithms for information retrieval. Journal of Information Science, 3, 1981, 177-183.
3. FRAKES, W.B. Stemming algorithms. In: FRAKES, W.B. and BAEZA-YATES, R., eds. Information retrieval: data structures and algorithms. Englewood Cliffs: Prentice-Hall, 1992, 131-160.
4. PORTER, M.F. An algorithm for suffix stripping. Program, 14, 1980, 130-137.
5. ULMSCHNEIDER, J.E. and DOSZKOCS, T. A practical stemming algorithm for online search assistance. Online Review, 7, 1983, 301-308.
6. PAICE, C.D. Another stemmer. ACM SIGIR Forum, 24(3), 1990, 56-61.
7. POPOVIC, M. and WILLETT, P. Processing of documents and queries in a Slovene language free text retrieval system. Literary and Linguistic Computing, 5, 1990, 182-190.
8. SAVOY, J. Stemming of French words based on grammatical categories. Journal of the American Society for Information Science, 44, 1993, 1-9.
9. AL-KHARASHI, I.A. and EVENS, M.W. Comparing words, stems and roots as index terms in an Arabic information retrieval system. Journal of the American Society for Information Science, 45, 1994, 548-560.
10. KALAMBOUKIS, T.Z. Suffix stripping with modern Greek. Program, 29, 1995, 313-321.
11. SOLAK, A. and OFLAZER, K. Design and implementation of a spelling checker for Turkish. Literary and Linguistic Computing, 8, 1993, 113-130.
12. AHMAD, F., YUSOFF, M. and SEMBOK, T.M.T. Experiments with a Malay stemming algorithm. Submitted for publication.
13. LOVINS, J.B. Error evaluation for stemming algorithms as clustering algorithms. Journal of the American Society for Information Science, 22, 1971, 28-40.
14. PAICE, C.D. An evaluation method for stemming algorithms. In: CROFT, W.B. and VAN RIJSBERGEN, C.J., eds. SIGR '94 - Proceedings of the seventeenth annual international ACM-SIGR conference on research and development in information retrieval. London: Springer-Verlag, 1994, 42-50.
15. HARMAN, D. How effective is stemming? Journal of the American Society for Information Science, 42, 1991, 7-15.
16. KEEN, E.M. The effect of stemming strength on the effectiveness of output ranking. In: JONES, K.P., ed. The structuring of information - Informatics 11. London: Aslib, 1991, 37-50.
17. POPOVIC, M. and WILLETT, P. The effectiveness of stemming for natural-language access to Slovene textual data. Journal of the American Society for Information Science, 45, 1992, 384-390.
18. LESLIE, M. The Hartlib Papers Project: text retrieval in large datasets. Literary and Linguistic Computing, 5, 1990, 58-69.
19. GREENGRASS, M. Samuel Hartlib: 'intelligenceur' européen. In: Diffusion du savoir et affrontement des idées, 1600-1770. Festival d'Histoire de Montbrison, 1992, 213-234.