Frakes, W.B.: Stemming algorithms (1992)
0.01
0.010994123 = product of:
0.065964736 = sum of:
0.065964736 = product of:
0.13192947 = sum of:
0.13192947 = weight(_text_:programs in 3503) [ClassicSimilarity], result of:
0.13192947 = score(doc=3503,freq=2.0), product of:
0.25748047 = queryWeight, product of:
5.79699 = idf(docFreq=364, maxDocs=44218)
0.044416238 = queryNorm
0.5123863 = fieldWeight in 3503, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.79699 = idf(docFreq=364, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.5 = coord(1/2)
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
