Search (4 results, page 1 of 1)

  • × author_ss:"Salton, G."
  • × author_ss:"Singhal, A."
  • × type_ss:"a"
  1. Salton, G.; Allen, J.; Buckley, C.; Singhal, A.: Automatic analysis, theme generation, and summarization of machine-readable data (1994) 0.00
    0.0027618767 = product of:
      0.00828563 = sum of:
        0.00828563 = product of:
          0.01657126 = sum of:
            0.01657126 = weight(_text_:of in 1168) [ClassicSimilarity], result of:
              0.01657126 = score(doc=1168,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.24188137 = fieldWeight in 1168, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.109375 = fieldNorm(doc=1168)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  2. Buckley, C.; Singhal, A.; Mitra, M.; Salton, G.: New retrieval approaches using SMART : TREC 4 (1996) 0.00
    0.0023673228 = product of:
      0.0071019684 = sum of:
        0.0071019684 = product of:
          0.014203937 = sum of:
            0.014203937 = weight(_text_:of in 7528) [ClassicSimilarity], result of:
              0.014203937 = score(doc=7528,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.20732689 = fieldWeight in 7528, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.09375 = fieldNorm(doc=7528)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Imprint
    Gaithersburgh, MD : National Institute of Standards and Technology
  3. Salton, G.; Allan, J.; Buckley, C.; Singhal, A.: Automatic analysis, theme generation, and summarization of machine readable texts (1994) 0.00
    0.001972769 = product of:
      0.0059183068 = sum of:
        0.0059183068 = product of:
          0.0118366135 = sum of:
            0.0118366135 = weight(_text_:of in 1949) [ClassicSimilarity], result of:
              0.0118366135 = score(doc=1949,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.17277241 = fieldWeight in 1949, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.078125 = fieldNorm(doc=1949)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  4. Salton, G.; Allan, J.; Singhal, A.: Automatic text decomposition and structuring (1996) 0.00
    0.0015782153 = product of:
      0.0047346456 = sum of:
        0.0047346456 = product of:
          0.009469291 = sum of:
            0.009469291 = weight(_text_:of in 4067) [ClassicSimilarity], result of:
              0.009469291 = score(doc=4067,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.13821793 = fieldWeight in 4067, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0625 = fieldNorm(doc=4067)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Sophisticated text similarity measurements are used to determine relationships between natural language text and text excerpts. The resulting linked hypertext maps can be decomposed into text segments and text theme, and these decompositions are usable to identify different text types and text structures, leading to improved text access and utilization. Gives examples of text decomposition for expository and non expository texts