Frakes, W.B.: Stemming algorithms (1992)
0.01
0.014963423 = product of:
0.05985369 = sum of:
0.047231287 = weight(_text_:retrieval in 3503) [ClassicSimilarity], result of:
0.047231287 = score(doc=3503,freq=4.0), product of:
0.124912694 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.041294612 = queryNorm
0.37811437 = fieldWeight in 3503, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.012622404 = weight(_text_:of in 3503) [ClassicSimilarity], result of:
0.012622404 = score(doc=3503,freq=4.0), product of:
0.06457475 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.041294612 = queryNorm
0.19546966 = fieldWeight in 3503, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.25 = coord(2/8)
- 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
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
