When stopword lists make the difference

  • Authors:
  • Ljiljana Dolamic;Jacques Savoy

  • Affiliations:
  • Computer Science Department, University of Neuchâtel, 2009 Neuchâtel, Switzerland;Computer Science Department, University of Neuchâtel, 2009 Neuchâtel, Switzerland

  • Venue:
  • Journal of the American Society for Information Science and Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this brief communication, we evaluate the use of two stopword lists for the English language (one comprising 571 words and another with 9) and compare them with a search approach accounting for all word forms. We show that through implementing the original Okapi form or certain ones derived from the Divergence from Randomness (DFR) paradigm, significantly lower performance levels may result when using short or no stopword lists. For other DFR models and a revised Okapi implementation, performance differences between approaches using short or long stopword lists or no list at all are usually not statistically significant. Similar conclusions can be drawn when using other natural languages such as French, Hindi, or Persian. © 2010 Wiley Periodicals, Inc.