Search (6 results, page 1 of 1)

  • × author_ss:"Robertson, A.M."
  • × author_ss:"Willett, P."
  • × language_ss:"e"
  1. Ekmekcioglu, F.C.; Robertson, A.M.; Willett, P.: Effectiveness of query expansion in ranked-output document retrieval systems (1992) 0.01
    0.0066239215 = product of:
      0.046367448 = sum of:
        0.006682779 = weight(_text_:information in 5689) [ClassicSimilarity], result of:
          0.006682779 = score(doc=5689,freq=2.0), product of:
            0.04306919 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.02453417 = queryNorm
            0.1551638 = fieldWeight in 5689, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=5689)
        0.03968467 = weight(_text_:retrieval in 5689) [ClassicSimilarity], result of:
          0.03968467 = score(doc=5689,freq=8.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.5347345 = fieldWeight in 5689, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=5689)
      0.14285715 = coord(2/14)
    
    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
    Source
    Journal of information science. 18(1992) no.2, S.139-147
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  2. Robertson, A.M.; Willett, P.: Use of genetic algorithms in information retrieval (1995) 0.01
    0.005662316 = product of:
      0.03963621 = sum of:
        0.011574914 = weight(_text_:information in 2418) [ClassicSimilarity], result of:
          0.011574914 = score(doc=2418,freq=6.0), product of:
            0.04306919 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.02453417 = queryNorm
            0.2687516 = fieldWeight in 2418, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=2418)
        0.028061297 = weight(_text_:retrieval in 2418) [ClassicSimilarity], result of:
          0.028061297 = score(doc=2418,freq=4.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.37811437 = fieldWeight in 2418, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=2418)
      0.14285715 = coord(2/14)
    
    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
  3. Robertson, A.M.; Willett, P.: Applications of n-grams in textual information systems (1998) 0.01
    0.005662316 = product of:
      0.03963621 = sum of:
        0.011574914 = weight(_text_:information in 4715) [ClassicSimilarity], result of:
          0.011574914 = score(doc=4715,freq=6.0), product of:
            0.04306919 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.02453417 = queryNorm
            0.2687516 = fieldWeight in 4715, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=4715)
        0.028061297 = weight(_text_:retrieval in 4715) [ClassicSimilarity], result of:
          0.028061297 = score(doc=4715,freq=4.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.37811437 = fieldWeight in 4715, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=4715)
      0.14285715 = coord(2/14)
    
    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
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  4. Jones, G.; Robertson, A.M.; Willett, P.: ¬An introduction to genetic algorithms and to their use in information retrieval (1994) 0.01
    0.0053588827 = product of:
      0.037512176 = sum of:
        0.009450877 = weight(_text_:information in 7415) [ClassicSimilarity], result of:
          0.009450877 = score(doc=7415,freq=4.0), product of:
            0.04306919 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.02453417 = queryNorm
            0.21943474 = fieldWeight in 7415, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=7415)
        0.028061297 = weight(_text_:retrieval in 7415) [ClassicSimilarity], result of:
          0.028061297 = score(doc=7415,freq=4.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.37811437 = fieldWeight in 7415, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=7415)
      0.14285715 = coord(2/14)
    
    Abstract
    This paper provides an introduction to genetic algorithms, a new approach to the investigation of computationally-intensive problems that may be insoluble using conventional, deterministic approaches. A genetic algorithm takes an initial set of possible starting solutions and then iteratively improves theses solutions using operators that are analogous to those involved in Darwinian evolution. The approach is illusrated by reference to several problems in information retrieval
  5. Robertson, A.M.; Willett, P.: Retrieval techniques for historical English text : searching the sixteenth and seventeenth century titles in the Catalogue of Caterbury Cathedral Library using spelling-correction methods (1992) 0.00
    0.003927156 = product of:
      0.02749009 = sum of:
        0.010128049 = weight(_text_:information in 4209) [ClassicSimilarity], result of:
          0.010128049 = score(doc=4209,freq=6.0), product of:
            0.04306919 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.02453417 = queryNorm
            0.23515764 = fieldWeight in 4209, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4209)
        0.017362041 = weight(_text_:retrieval in 4209) [ClassicSimilarity], result of:
          0.017362041 = score(doc=4209,freq=2.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.23394634 = fieldWeight in 4209, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4209)
      0.14285715 = coord(2/14)
    
    Imprint
    Oxford : Learned Information Ltd.
    Source
    Online information 92. Proc. of the 16th Int. Online Information Meeting, London, 8-10.12.1992. Ed. by David I. Raitt
  6. Robertson, A.M.; Willett, P.: Identification of word-variants in historical text databases : report for the period October 1990 to September 1992 (1994) 0.00
    0.0020043785 = product of:
      0.028061297 = sum of:
        0.028061297 = weight(_text_:retrieval in 939) [ClassicSimilarity], result of:
          0.028061297 = score(doc=939,freq=4.0), product of:
            0.07421378 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.02453417 = queryNorm
            0.37811437 = fieldWeight in 939, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=939)
      0.071428575 = coord(1/14)
    
    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
    Footnote
    Auch ein Beitrag zu den Problemen des Freitext-Retrieval