Search (4 results, page 1 of 1)

  • × author_ss:"Craven, T.C."
  • × theme_ss:"Register"
  1. Craven, T.C.: NEPHIS: a nested phrase indexing system (1977) 0.00
    0.00334869 = product of:
      0.00669738 = sum of:
        0.00669738 = product of:
          0.01339476 = sum of:
            0.01339476 = weight(_text_:a in 1333) [ClassicSimilarity], result of:
              0.01339476 = score(doc=1333,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.25222903 = fieldWeight in 1333, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.109375 = fieldNorm(doc=1333)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Type
    a
  2. Craven, T.C.: Adapting of string indexing systems for retrieval using proximity operators (1988) 0.00
    0.0030255679 = product of:
      0.0060511357 = sum of:
        0.0060511357 = product of:
          0.012102271 = sum of:
            0.012102271 = weight(_text_:a in 705) [ClassicSimilarity], result of:
              0.012102271 = score(doc=705,freq=10.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.22789092 = fieldWeight in 705, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0625 = fieldNorm(doc=705)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    This article explores the idea of using a conventional string indexing source description, together with a special phrase generator, to generate multiple descriptor phrases for inclusion in a database record for online retrieval. For use with proximity operators, these multiple descriptor phrases should attempt to meet such objectives as bringing together groups of syntactically related words. Software for generating multiple descriptor phrases from source descriptions in a specific existing string indexing system is briefly described
    Type
    a
  3. Craven, T.C.: Changing technologies: impact on information: the case of string indexing (1985) 0.00
    0.00270615 = product of:
      0.0054123 = sum of:
        0.0054123 = product of:
          0.0108246 = sum of:
            0.0108246 = weight(_text_:a in 1348) [ClassicSimilarity], result of:
              0.0108246 = score(doc=1348,freq=2.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.20383182 = fieldWeight in 1348, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.125 = fieldNorm(doc=1348)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Type
    a
  4. Craven, T.C.: ¬An online index entry format based on multiple search terms (1987) 0.00
    0.0023919214 = product of:
      0.0047838427 = sum of:
        0.0047838427 = product of:
          0.009567685 = sum of:
            0.009567685 = weight(_text_:a in 438) [ClassicSimilarity], result of:
              0.009567685 = score(doc=438,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.18016359 = fieldWeight in 438, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.078125 = fieldNorm(doc=438)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    A new approach to generate string index entries from concept networks is discussed: terms from multi-term search specifications are cited near the beginning of the entry, while an articulated entry structure indicative of concept relations is retained.
    Type
    a