Search (6 results, page 1 of 1)

Ruge, G.; Schwarz, C.: Natural language access to free-text data bases (1989) 0.04

0.041047435 = product of:
  0.10261859 = sum of:
    0.05648775 = weight(_text_:context in 3567) [ClassicSimilarity], result of:
      0.05648775 = score(doc=3567,freq=2.0), product of:
        0.17622331 = queryWeight, product of:
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.04251826 = queryNorm
        0.32054642 = fieldWeight in 3567, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3567)
    0.04613084 = weight(_text_:system in 3567) [ClassicSimilarity], result of:
      0.04613084 = score(doc=3567,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.34448233 = fieldWeight in 3567, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3567)
  0.4 = coord(2/5)

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.

Ruge, G.: Sprache und Computer : Wortbedeutung und Termassoziation. Methoden zur automatischen semantischen Klassifikation (1995) 0.03

0.034848943 = product of:
  0.08712236 = sum of:
    0.07176066 = weight(_text_:index in 1534) [ClassicSimilarity], result of:
      0.07176066 = score(doc=1534,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.3862362 = fieldWeight in 1534, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=1534)
    0.015361699 = product of:
      0.046085097 = sum of:
        0.046085097 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
          0.046085097 = score(doc=1534,freq=2.0), product of:
            0.1488917 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04251826 = queryNorm
            0.30952093 = fieldWeight in 1534, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=1534)
      0.33333334 = coord(1/3)
  0.4 = coord(2/5)

Content: Enthält folgende Kapitel: (1) Motivation; (2) Language philosophical foundations; (3) Structural comparison of extensions; (4) Earlier approaches towards term association; (5) Experiments; (6) Spreading-activation networks or memory models; (7) Perspective. Appendices: Heads and modifiers of 'car'. Glossary. Index. Language and computer. Word semantics and term association. Methods towards an automatic semantic classification
Footnote: Rez. in: Knowledge organization 22(1995) no.3/4, S.182-184 (M.T. Rolland)

Ruge, G.: Experiments on linguistically-based term associations (1992) 0.01
```
0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 1810) [ClassicSimilarity], result of:
      0.03727935 = score(doc=1810,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 1810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=1810)
  0.2 = coord(1/5)
```
Abstract

Describes the hyperterm system REALIST (REtrieval Aids by LInguistic and STatistics) and describes its semantic component. The semantic component of REALIST generates semantic term relations such synonyms. It takes as input a free text data base and generates as output term pairs that are semantically related with respect to their meanings in the data base. In the 1st step an automatic syntactic analysis provides linguistical knowledge about the terms of the data base. In the 2nd step this knowledge is compared by statistical similarity computation. Various experiments with different similarity measures are described

Ruge, G.; Schwarz, C.: Linguistically based term associations : a new semantic component for a hyperterm system (1990) 0.01

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 5544) [ClassicSimilarity], result of:
      0.03727935 = score(doc=5544,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 5544, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=5544)
  0.2 = coord(1/5)

Ruge, G.; Schwarz, C.: ¬Die Leistungsfähigkeit von linguistischen Verfahren in der Massentextverarbeitung (1989) 0.01
```
0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 6969) [ClassicSimilarity], result of:
      0.03727935 = score(doc=6969,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 6969, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=6969)
  0.2 = coord(1/5)
```
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

Ruge, G.: ¬A spreading activation network for automatic generation of thesaurus relationships (1991) 0.01

0.005376595 = product of:
  0.026882974 = sum of:
    0.026882974 = product of:
      0.08064892 = sum of:
        0.08064892 = weight(_text_:22 in 4506) [ClassicSimilarity], result of:
          0.08064892 = score(doc=4506,freq=2.0), product of:
            0.1488917 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04251826 = queryNorm
            0.5416616 = fieldWeight in 4506, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=4506)
      0.33333334 = coord(1/3)
  0.2 = coord(1/5)

Date: 8.10.2000 11:52:22

Search (6 results, page 1 of 1)

Years

Languages

Types

Themes