Frakes, W.B.: Stemming algorithms (1992)
0.00
0.0025028288 = product of:
0.0075084865 = sum of:
0.0075084865 = weight(_text_:a in 3503) [ClassicSimilarity], result of:
0.0075084865 = score(doc=3503,freq=4.0), product of:
0.05209492 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.045180224 = queryNorm
0.14413087 = fieldWeight in 3503, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.33333334 = coord(1/3)
- 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
- Type
- a
