Frakes, W.B.: Stemming algorithms (1992)
0.01
0.008201688 = product of:
0.05741181 = sum of:
0.05741181 = weight(_text_:studies in 3503) [ClassicSimilarity], result of:
0.05741181 = score(doc=3503,freq=2.0), product of:
0.1627809 = queryWeight, product of:
3.9902744 = idf(docFreq=2222, maxDocs=44218)
0.04079441 = queryNorm
0.35269377 = fieldWeight in 3503, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9902744 = idf(docFreq=2222, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.14285715 = coord(1/7)
- Abstract
- Desribes stemming algorithms - programs that relate morphologically similar indexing and search terms. Stemming is used to improve retrieval effectiveness and to reduce the size of indexing files. Several approaches to stemming are describes - table lookup, affix removal, successor variety, and n-gram. empirical studies of stemming are summarized. The Porter stemmer is described in detail, and a full implementation in C is presented
