YASS
Authors:
Open Access
- 1 October 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 25 (4) , 18
Abstract
Stemmers attempt to reduce a word to its stem or root form and are used widely in information retrieval tasks to increase the recall rate. Most popular stemmers encode a large number of language-specific rules built over a length of time. Such stemmers with comprehensive rules are available only for a few languages. In the absence of extensive linguistic resources for certain languages, statistical language processing tools have been successfully used to improve the performance of IR systems. In this article, we describe a clustering-based approach to discover equivalence classes of root words and their morphological variants. A set of string distance measures are defined, and the lexicon for a given text collection is clustered using the distance measures to identify these equivalence classes. The proposed approach is compared with Porter's and Lovin's stemmers on the AP and WSJ subcollections of the Tipster dataset using 200 queries. Its performance is comparable to that of Porter's and Lovin's stemmers, both in terms of average precision and the total number of relevant documents retrieved. The proposed stemming algorithm also provides consistent improvements in retrieval performance for French and Bengali, which are currently resource-poor.Keywords
This publication has 13 references indexed in Scilit:
- A probabilistic model for stemmer generationInformation Processing & Management, 2005
- Unsupervised learning of Arabic stemming using a parallel corpus2003
- Cross language information retrievalACM SIGIR Forum, 2002
- Unsupervised Learning of the Morphology of a Natural LanguageComputational Linguistics, 2001
- Viewing morphology as an inference processArtificial Intelligence, 2000
- A morphologically sensitive clustering algorithm for identifying Arabic roots2000
- Data clusteringACM Computing Surveys, 1999
- Corpus-based stemming using cooccurrence of word variantsACM Transactions on Information Systems, 1998
- An algorithm for suffix strippingProgram: electronic library and information systems, 1980
- The use of an association measure based on character structure to identify semantically related pairs of words and document titlesInformation Storage and Retrieval, 1974