Frakes, W.B.: Stemming algorithms (1992)
0.00
0.001682769 = product of:
0.010096614 = sum of:
0.010096614 = weight(_text_:in in 3503) [ClassicSimilarity], result of:
0.010096614 = score(doc=3503,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.17003182 = fieldWeight in 3503, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.16666667 = coord(1/6)
- 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
