FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Dependency Structures and Lexicalized Grammars

Dependency Structures and Lexicalized Grammars

Marco Kuhlmann
    Product form
      FORMAT: Paperback / softback

      R 1,532.13 Price and availability exclusive to website

      YOU COULD EARN 1,532.13 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 255.35 per month!
      3x monthly payments of R 510.71 with
      4x fortnightly payments of R 383.03 with
      Since 2002, FoLLI has awarded an annual prize for outstanding dissertations in the fields of Logic, Language and Information. This book is based on the PhD thesis of Marco Kuhlmann, joint winner of the E.W. Beth dissertation award in 2008.Kuhlmann’s thesis lays new theoretical foundations for the study of non-projective dependency grammars. These grammars are becoming increasingly important for approaches to statistical parsing in computational linguistics that deal with free word order and long-distance dependencies. The author provides new formal tools to define and understand dependency grammars, presents two new dependency language hierarchies with polynomial parsing algorithms, establishes the practical significance of these hierarchies through corpus studies, and links his work to the phrase-structure grammar tradition through an equivalence result with tree-adjoining grammars. The work bridges the gaps between linguistics and theoretical computer science, between theoretical and empirical approaches in computational linguistics, and between previously disconnected strands of formal language research.
      Format: Paperback / softback CONTRIBUTORS: Marco Kuhlmann EAN: 9783642145674 COUNTRY: Germany PAGES: WEIGHT: 454 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2010-07-30 CITY: GENRE: COMPUTERS / Artificial Intelligence / General WIDTH: 155 cm SPINE:

      Book Themes:

      Artificial intelligence

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Since 2002, FoLLI has awarded an annual prize for outstanding dissertations in the fields of Logic, Language and Information. This book is based on the PhD thesis of Marco Kuhlmann, joint winner of the E.W. Beth dissertation award in 2008.Kuhlmann’s thesis lays new theoretical foundations for the study of non-projective dependency grammars. These grammars are becoming increasingly important for approaches to statistical parsing in computational linguistics that deal with free word order and long-distance dependencies. The author provides new formal tools to define and understand dependency grammars, presents two new dependency language hierarchies with polynomial parsing algorithms, establishes the practical significance of these hierarchies through corpus studies, and links his work to the phrase-structure grammar tradition through an equivalence result with tree-adjoining grammars. The work bridges the gaps between linguistics and theoretical computer science, between theoretical and empirical approaches in computational linguistics, and between previously disconnected strands of formal language research.
      Format: Paperback / softback CONTRIBUTORS: Marco Kuhlmann EAN: 9783642145674 COUNTRY: Germany PAGES: WEIGHT: 454 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2010-07-30 CITY: GENRE: COMPUTERS / Artificial Intelligence / General WIDTH: 155 cm SPINE:

      Book Themes:

      Artificial intelligence

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account