Frakes, W.B.: Stemming algorithms (1992)
0.01
0.012262408 = product of:
0.024524815 = sum of:
0.024524815 = product of:
0.073574446 = sum of:
0.073574446 = weight(_text_:n in 3503) [ClassicSimilarity], result of:
0.073574446 = score(doc=3503,freq=2.0), product of:
0.19305801 = queryWeight, product of:
4.3116565 = idf(docFreq=1611, maxDocs=44218)
0.044775832 = queryNorm
0.38110018 = fieldWeight in 3503, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.3116565 = idf(docFreq=1611, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- 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
