Search (1 results, page 1 of 1)

0.0011839407 = product of:
  0.0023678814 = sum of:
    0.0023678814 = product of:
      0.0047357627 = sum of:
        0.0047357627 = weight(_text_:a in 3567) [ClassicSimilarity], result of:
          0.0047357627 = score(doc=3567,freq=2.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.089176424 = fieldWeight in 3567, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3567)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Problems of indexing and searching free-text data bases are discussed in detail. The possibilities and limitations of Boolean searching are shown. An experimental system COPSY (Context operator syntax) that was built in order to avoid common errors connected with Boolean search is outlined. This system permits, as input, any natural language search question formulation and yields, as output, documents ranked on the basis of an automatically calculated correspondence between natural language search questions and content-based analysis of documents. COPSY is part of a text processing project at Siemens AG called TINA (Text-Inhalts-Analyse...). Software from TINA is actually being applied and evaluated by the US Department of Commerce for patent searching and indexing.