Search (10 results, page 1 of 1)

0.054400608 = product of:
  0.16320182 = sum of:
    0.16320182 = weight(_text_:query in 2300) [ClassicSimilarity], result of:
      0.16320182 = score(doc=2300,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.71152055 = fieldWeight in 2300, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=2300)
  0.33333334 = coord(1/3)

Abstract

Summarises the results to date of a continuing programme of research at Sheffield Univ. to investigate the use of nearest-neighbour retrieval algorithms for full text searching. Given a natural language query statement, the research methods result in a ranking of the paragraphs comprising a full text document in order of decreasing similarity with the query, where the similarity for each paragraph is determined by the number of keyword stems that it has in common with the query

0.04441791 = product of:
  0.13325372 = sum of:
    0.13325372 = weight(_text_:query in 2418) [ClassicSimilarity], result of:
      0.13325372 = score(doc=2418,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5809541 = fieldWeight in 2418, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=2418)
  0.33333334 = coord(1/3)

Abstract

Reviews the basic techniques involving genetic algorithms and their application to 2 problems in information retrieval: the generation of equifrequent groups of index terms; and the identification of optimal query and term weights. The algorithm developed for the generation of equifrequent groupings proved to be effective in operation, achieving results comparable with those obtained using a good deterministic algorithm. The algorithm developed for the identification of optimal query and term weighting involves fitness function that is based on full relevance information

0.04441791 = product of:
  0.13325372 = sum of:
    0.13325372 = weight(_text_:query in 6977) [ClassicSimilarity], result of:
      0.13325372 = score(doc=6977,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5809541 = fieldWeight in 6977, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=6977)
  0.33333334 = coord(1/3)

Abstract

Describes the development of a genetic algorithm (GA) for the assignment of weights to query terms in a ranked output document retrieval system. The GA involves a fitness function that is based on full relevance information, and the rankings resulting from the use of these weights are compared with the Robertson-Sparck Jones F4 retrospective relevance weight

0.031408206 = product of:
  0.09422461 = sum of:
    0.09422461 = weight(_text_:query in 939) [ClassicSimilarity], result of:
      0.09422461 = score(doc=939,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.41079655 = fieldWeight in 939, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=939)
  0.33333334 = coord(1/3)

Abstract

Databases of historical texts are increasingly becoming available for end user searching via online or CD-ROM databases. Many of the words in these databases are spelt differently from today with resultant loss of retrieval. The project evaluated a range of techniques that can suggest historical variants of modern language query words, the work deriving from earlier work on spelling correction

0.031408206 = product of:
  0.09422461 = sum of:
    0.09422461 = weight(_text_:query in 5689) [ClassicSimilarity], result of:
      0.09422461 = score(doc=5689,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.41079655 = fieldWeight in 5689, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=5689)
  0.33333334 = coord(1/3)

0.031408206 = product of:
  0.09422461 = sum of:
    0.09422461 = weight(_text_:query in 4715) [ClassicSimilarity], result of:
      0.09422461 = score(doc=4715,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.41079655 = fieldWeight in 4715, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, 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

0.027482178 = product of:
  0.08244653 = sum of:
    0.08244653 = weight(_text_:query in 4209) [ClassicSimilarity], result of:
      0.08244653 = score(doc=4209,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35944697 = fieldWeight in 4209, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4209)
  0.33333334 = coord(1/3)

Abstract

A range of techniques has been developed for the correction of misspellings in machine readable texts. Discusses the use of such techniques for the identification of words in the sixteenth and seventeenth century titles from the Catalogue of Canterbury Cathedral Library that are most similar to query words in modern English. The experiments used digram matching, non phonetic coding, and dynamic programming methods for spelling correction. These allow very high recall searches to be carried out, although the latter methods are very demanding of computer resources

0.027482178 = product of:
  0.08244653 = sum of:
    0.08244653 = weight(_text_:query in 2828) [ClassicSimilarity], result of:
      0.08244653 = score(doc=2828,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35944697 = fieldWeight in 2828, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2828)
  0.33333334 = coord(1/3)

Abstract

SIBRIS (Sandwich Interactive Browsing and Ranking Information System) is an interactive text retrieval system which has been developed to support the browsing of library and product files at Pfizer Central Research, Sandwich, UK. Once an initial ranking has been produced, the system will allow the user to select any document displayed on the screen at any point during the browse and to use that as the basis for another search. Facilities have been included to enable the user to keep track of the browse and to facilitate backtracking, thus allowing the user to move away from the original query to wander in and out of different areas of interest.

0.023556154 = product of:
  0.07066846 = sum of:
    0.07066846 = weight(_text_:query in 6716) [ClassicSimilarity], result of:
      0.07066846 = score(doc=6716,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.30809742 = fieldWeight in 6716, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.046875 = fieldNorm(doc=6716)
  0.33333334 = coord(1/3)

Abstract

Describes the use of a variety of similarity coefficients in the measurement of the degree of similarity between objects that contain textual information, such as documents, paragraphs, index terms or queries. The work is intended as a preliminary to future investigation of the calculations involved in measuring the degree of similarity between structured objects that may be represented by graph theoretic forms. Descusses the role of similarity coefficients in text retrieval in terms of: document and query similarity; document and document similarity; cocitation analysis; term and term similarity; and the similarity between sets of judgements, such as relevance judgements. Describes several methods for expressing the formulae used to define similarity coefficients and compares their attributes. Concludes with details the characteristics of similarity coefficients; equivalence and monotonicity; consideration of negative matches; geometric analyses; and the meaning of correlation coefficients

0.0066865305 = product of:
  0.020059591 = sum of:
    0.020059591 = product of:
      0.040119182 = sum of:
        0.040119182 = weight(_text_:22 in 5258) [ClassicSimilarity], result of:
          0.040119182 = score(doc=5258,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.23214069 = fieldWeight in 5258, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=5258)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 7.2006 14:40:10