Search (3 results, page 1 of 1)

0.006555808 = product of:
  0.019667422 = sum of:
    0.019667422 = product of:
      0.059002265 = sum of:
        0.059002265 = weight(_text_:theory in 1529) [ClassicSimilarity], result of:
          0.059002265 = score(doc=1529,freq=4.0), product of:
            0.18161562 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.04367448 = queryNorm
            0.3248744 = fieldWeight in 1529, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1529)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

LCSH

Knowledge / representation (Information theory)

Subject

Knowledge / representation (Information theory)

0.0055627874 = product of:
  0.016688362 = sum of:
    0.016688362 = product of:
      0.050065085 = sum of:
        0.050065085 = weight(_text_:theory in 685) [ClassicSimilarity], result of:
          0.050065085 = score(doc=685,freq=2.0), product of:
            0.18161562 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.04367448 = queryNorm
            0.27566507 = fieldWeight in 685, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.046875 = fieldNorm(doc=685)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Parsing, the syntactic analysis of language, has been studied extensively in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introductions reviews the thory of parsing from a novel perspective, it provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text

0.0055627874 = product of:
  0.016688362 = sum of:
    0.016688362 = product of:
      0.050065085 = sum of:
        0.050065085 = weight(_text_:theory in 1603) [ClassicSimilarity], result of:
          0.050065085 = score(doc=1603,freq=2.0), product of:
            0.18161562 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.04367448 = queryNorm
            0.27566507 = fieldWeight in 1603, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.046875 = fieldNorm(doc=1603)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Statistical approaches to processing natural language text have become dominant in recent years. This foundational text is the first comprehensive introduction to statistical Natural Language Processing (NLP) to appear. The book contains all the theory and algorithms needed for building NLP tools. It provides broad but rigorous coverage of mathematical and linguistic foundations, as well as detailed discussion of statistical methods, allowing students and researchers to construct their own implementations. The book covers collocation finding, word sense disambiguation, probabilistic parsing, information retrieval, and other applications.