Stemming and its effects on TFIDF ranking (poster session)

Published 1 July 2000

Mark Kantrowitz, Behrang Mohit, Vibhu O. Mittal

Citations41

TL;DR

It is argued that stemming can help in certain contexts and that an empirical investigation of the relationship between stemming performance and retrieval performance can be valuable.

Abstract

Article Stemming and its effects on TFIDF ranking (poster session) Share on Authors: Mark Kantrowitz Just Research, 4616 Henry Street, Pittsburgh, PA Just Research, 4616 Henry Street, Pittsburgh, PAView Profile , Behrang Mohit School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile , Vibhu Mittal School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile Authors Info & Claims SIGIR '00: Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrievalJuly 2000 Pages 357–359https://doi.org/10.1145/345508.345650Online:01 July 2000Publication History 28citation101DownloadsMetricsTotal Citations28Total Downloads101Last 12 Months51Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer ScienceDecision Sciences

Program electronic library and information systemsAn algorithm for suffix stripping

8,136 Citations1980Martin Porter

An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL, and performs slightly better than a much more elaborate system with which it has been compared.

Communications of the ACMA technique for computer detection and correction of spelling errors

1,573 Citations1964Fred J. Damerau

The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition.

View PDF

Viewing morphology as an inference process

661 Citations1993Robert Krovetz

The role of morphological analysis in word sense disambiguation, and in identifying lexical semantic relationships in a machine-readable dictionary, is described.

Journal of the American Society for Information ScienceHow effective is suffixing?

388 Citations1991Donna Harman

Three measures were selected which evaluate performance at given rank cutoff points, such as those cor- responding to a screenful of document titles,such as those responding to the lists of the top ranked documents.

Journal of the American Society for Information ScienceStemming algorithms: A case study for detailed evaluation

371 Citations1996David A. Hull

A case study of stemming algorithms is described which describes a number of novel approaches to evaluation and demonstrates their value.

Viewing stemming as recall enhancement

163 Citations1996Wessel Kraaij, Renée Pohlmann

Results show that linguistic stemming restricted to inflection yields a significant improvement over full linguistic and non-linquistic stemming, both in average Precision and R-Recall.

View PDF

Journal of the American Society for Information ScienceMethod for evaluation of stemming algorithms based on error counting

85 Citations1996Chris D. Paice

Performance is assessed by counting the number of identifiable errors during the stemming of words from various text samples and it appears that the Lovins stemmer is inferior to the other two in terms of general accuracy.