Search (2 results, page 1 of 1)

  • × author_ss:"Ruge, G."
  • × author_ss:"Schwarz, C."
  • × year_i:[1980 TO 1990}
  1. Ruge, G.; Schwarz, C.: ¬Die Leistungsfähigkeit von linguistischen Verfahren in der Massentextverarbeitung (1989) 0.03 
    0.0270943 = product of:
  0.0541886 = sum of:
    0.0523083 = weight(_text_:von in 6969) [ClassicSimilarity], result of:
      0.0523083 = score(doc=6969,freq=6.0), product of:
        0.12806706 = queryWeight, product of:
          2.6679487 = idf(docFreq=8340, maxDocs=44218)
          0.04800207 = queryNorm
        0.40844458 = fieldWeight in 6969, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.6679487 = idf(docFreq=8340, maxDocs=44218)
          0.0625 = fieldNorm(doc=6969)
    0.0018803024 = product of:
      0.005640907 = sum of:
        0.005640907 = weight(_text_:a in 6969) [ClassicSimilarity], result of:
          0.005640907 = score(doc=6969,freq=2.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.10191591 = fieldWeight in 6969, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=6969)
      0.33333334 = coord(1/3)
  0.5 = coord(2/4)
    Abstract
    Dependenzstrukturen stellen syntagmatische Relationen von Worten in Texten dar. Ihre Anwendungsmöglichkeiten im Information Retrieval werden erläutert. Bei Siemens wurde ein System zur Transformation von Texten in Dependenzstrukturen entwickelt, wobei besonders darauf geachtet wurde, die Wirkung gegen den Aufwand abzuwiegen. Die letzte Version verarbeitet 20 MB Freitext in einer Stunde Realzeit auf einem Siemens BS2000 Großrechner. Analyse-Recall and Analyse-Precision liegen jeweils bei 0,85
    Type
    a
  2. Ruge, G.; Schwarz, C.: Natural language access to free-text data bases (1989) 0.00 
    4.1131617E-4 = product of:
  0.0016452647 = sum of:
    0.0016452647 = product of:
      0.004935794 = sum of:
        0.004935794 = weight(_text_:a in 3567) [ClassicSimilarity], result of:
          0.004935794 = score(doc=3567,freq=2.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = 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.33333334 = coord(1/3)
  0.25 = coord(1/4)
    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.

Languages

Types