Search (2 results, page 1 of 1)

0.013850185 = product of:
  0.041550554 = sum of:
    0.041550554 = product of:
      0.08310111 = sum of:
        0.08310111 = weight(_text_:22 in 262) [ClassicSimilarity], result of:
          0.08310111 = score(doc=262,freq=2.0), product of:
            0.15341885 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043811057 = queryNorm
            0.5416616 = fieldWeight in 262, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=262)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

20.10.2000 12:22:23

0.0022319334 = product of:
  0.0066958 = sum of:
    0.0066958 = product of:
      0.0133916 = sum of:
        0.0133916 = weight(_text_:of in 6982) [ClassicSimilarity], result of:
          0.0133916 = score(doc=6982,freq=4.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.19546966 = fieldWeight in 6982, 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=6982)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Reviews similarity measures for searching names. These measures deal with phonetic similarity, typing errors, and plain string similarity. Shows experimentally that all 3 approaches lead to significantly higher retrieval quality than plain identity. Further improvements are possible by combining different methods. Develops a probabilistic interpretation of string similarity that leads to better results than an ad-hoc approach