Search (2 results, page 1 of 1)

  • × author_ss:"Schwarz, C."
  • × year_i:[1980 TO 1990}
  1. Schwarz, C.: THESYS: Thesaurus Syntax System : a fully automatic thesaurus building aid (1988) 0.05
    0.047206 = product of:
      0.070809 = sum of:
        0.0469695 = weight(_text_:search in 1361) [ClassicSimilarity], result of:
          0.0469695 = score(doc=1361,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.2688082 = fieldWeight in 1361, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1361)
        0.0238395 = product of:
          0.047679 = sum of:
            0.047679 = weight(_text_:22 in 1361) [ClassicSimilarity], result of:
              0.047679 = score(doc=1361,freq=2.0), product of:
                0.17604718 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05027291 = queryNorm
                0.2708308 = fieldWeight in 1361, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=1361)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    THESYS is based on the natural language processing of free-text databases. It yields statistically evaluated correlations between words of the database. These correlations correspond to traditional thesaurus relations. The person who has to build a thesaurus is thus assisted by the proposals made by THESYS. THESYS is being tested on commercial databases under real world conditions. It is part of a text processing project at Siemens, called TINA (Text-Inhalts-Analyse). Software from TINA is actually being applied and evaluated by the US Department of Commerce for patent search and indexing (REALIST: REtrieval Aids by Linguistics and STatistics)
    Date
    6. 1.1999 10:22:07
  2. Ruge, G.; Schwarz, C.: Natural language access to free-text data bases (1989) 0.03
    0.027117856 = product of:
      0.08135357 = sum of:
        0.08135357 = weight(_text_:search in 3567) [ClassicSimilarity], result of:
          0.08135357 = score(doc=3567,freq=6.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.46558946 = fieldWeight in 3567, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3567)
      0.33333334 = coord(1/3)
    
    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.

Types