Search (4 results, page 1 of 1)

  • × theme_ss:"Computerlinguistik"
  • × type_ss:"x"
  1. Renker, L.: Exploration von Textkorpora : Topic Models als Grundlage der Interaktion (2015) 0.01
    0.009897877 = product of:
      0.019795755 = sum of:
        0.019795755 = product of:
          0.03959151 = sum of:
            0.03959151 = weight(_text_:l in 2380) [ClassicSimilarity], result of:
              0.03959151 = score(doc=2380,freq=2.0), product of:
                0.18031335 = queryWeight, product of:
                  3.9746525 = idf(docFreq=2257, maxDocs=44218)
                  0.045365814 = queryNorm
                0.2195706 = fieldWeight in 2380, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9746525 = idf(docFreq=2257, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=2380)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  2. Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012) 0.01
    0.009219662 = product of:
      0.018439325 = sum of:
        0.018439325 = product of:
          0.03687865 = sum of:
            0.03687865 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
              0.03687865 = score(doc=563,freq=2.0), product of:
                0.15886335 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.045365814 = queryNorm
                0.23214069 = fieldWeight in 563, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.046875 = fieldNorm(doc=563)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    10. 1.2013 19:22:47
  3. Lorenz, S.: Konzeption und prototypische Realisierung einer begriffsbasierten Texterschließung (2006) 0.01
    0.009219662 = product of:
      0.018439325 = sum of:
        0.018439325 = product of:
          0.03687865 = sum of:
            0.03687865 = weight(_text_:22 in 1746) [ClassicSimilarity], result of:
              0.03687865 = score(doc=1746,freq=2.0), product of:
                0.15886335 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.045365814 = queryNorm
                0.23214069 = fieldWeight in 1746, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.046875 = fieldNorm(doc=1746)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 3.2015 9:17:30
  4. Karlova-Bourbonus, N.: Automatic detection of contradictions in texts (2018) 0.01
    0.0059387265 = product of:
      0.011877453 = sum of:
        0.011877453 = product of:
          0.023754906 = sum of:
            0.023754906 = weight(_text_:l in 5976) [ClassicSimilarity], result of:
              0.023754906 = score(doc=5976,freq=2.0), product of:
                0.18031335 = queryWeight, product of:
                  3.9746525 = idf(docFreq=2257, maxDocs=44218)
                  0.045365814 = queryNorm
                0.13174236 = fieldWeight in 5976, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9746525 = idf(docFreq=2257, maxDocs=44218)
                  0.0234375 = fieldNorm(doc=5976)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Natural language contradictions are of complex nature. As will be shown in Chapter 5, the realization of contradictions is not limited to the examples such as Socrates is a man and Socrates is not a man (under the condition that Socrates refers to the same object in the real world), which is discussed by Aristotle (Section 3.1.1). Empirical evidence (see Chapter 5 for more details) shows that only a few contradictions occurring in the real life are of that explicit (prototypical) kind. Rather, con-tradictions make use of a variety of natural language devices such as, e.g., paraphrasing, synonyms and antonyms, passive and active voice, diversity of negation expression, and figurative linguistic means such as idioms, irony, and metaphors. Additionally, the most so-phisticated kind of contradictions, the so-called implicit contradictions, can be found only when applying world knowledge and after conducting a sequence of logical operations such as e.g. in: (1.1) The first prize was given to the experienced grandmaster L. Stein who, in total, col-lected ten points (7 wins and 3 draws). Those familiar with the chess rules know that a chess player gets one point for winning and zero points for losing the game. In case of a draw, each player gets a half point. Built on this idea and by conducting some simple mathematical operations, we can infer that in the case of 7 wins and 3 draws (the second part of the sentence), a player can only collect 8.5 points and not 10 points. Hence, we observe that there is a contradiction between the first and the second parts of the sentence.