Search (1 results, page 1 of 1)

  • × author_ss:"Frakes, W.B."
  • × theme_ss:"Computerlinguistik"
  • × year_i:[1990 TO 2000}
  1. Frakes, W.B.: Stemming algorithms (1992) 0.00 
    0.0015666279 = product of:
  0.0031332558 = sum of:
    0.0031332558 = product of:
      0.0062665115 = sum of:
        0.0062665115 = weight(_text_:a in 3503) [ClassicSimilarity], result of:
          0.0062665115 = score(doc=3503,freq=4.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = 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.5 = coord(1/2)
  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
    Type
    a