Search (2 results, page 1 of 1)

  • × author_ss:"Willett, P."
  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  1. Ekmekcioglu, F.C.; Robertson, A.M.; Willett, P.: Effectiveness of query expansion in ranked-output document retrieval systems (1992) 0.00 
    0.003065327 = product of:
  0.009195981 = sum of:
    0.009195981 = weight(_text_:a in 5689) [ClassicSimilarity], result of:
      0.009195981 = score(doc=5689,freq=6.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.17652355 = fieldWeight in 5689, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=5689)
  0.33333334 = coord(1/3)
    Abstract
    Reports an evaluation of 3 methods for the expansion of natural language queries in ranked output retrieval systems. The methods are based on term co-occurrence data, on Soundex codes, and on a string similarity measure. Searches for 110 queries in a data base of 26.280 titles and abstracts suggest that there is no significant difference in retrieval effectiveness between any of these methods and unexpanded searches
    Type
    a
  2. Robertson, A.M.; Willett, P.: Applications of n-grams in textual information systems (1998) 0.00 
    0.003065327 = product of:
  0.009195981 = sum of:
    0.009195981 = weight(_text_:a in 4715) [ClassicSimilarity], result of:
      0.009195981 = score(doc=4715,freq=6.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.17652355 = fieldWeight in 4715, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=4715)
  0.33333334 = coord(1/3)
    Abstract
    Provides an introduction to the use of n-grams in textual information systems, where an n-gram is a string of n, usually adjacent, characters, extracted from a section of continuous text. Applications that can be implemented efficiently and effectively using sets of n-grams include spelling errors detection and correction, query expansion, information retrieval with serial, inverted and signature files, dictionary look up, text compression, and language identification
    Type
    a

Authors