Back to Search

Dependency Structures and Lexicalized Grammars: An Algebraic Approach

PUBLISHER Springer (07/30/2010)
PRODUCT TYPE Paperback (Paperback)

Description
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.
Show More
Product Format
Product Details
ISBN-13: 9783642145674
ISBN-10: 3642145671
Binding: Paperback or Softback (Trade Paperback (Us))
Content Language: English
More Product Details
Page Count: 137
Carton Quantity: 58
Product Dimensions: 6.10 x 0.40 x 9.20 inches
Weight: 0.55 pound(s)
Feature Codes: Bibliography, Index, Table of Contents, Illustrated
Country of Origin: DE
Subject Information
BISAC Categories
Computers | Artificial Intelligence - General
Computers | Computer Science
Computers | Logic Design
Dewey Decimal: 006.3
Descriptions, Reviews, Etc.
publisher marketing
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.
Show More
List Price $54.99
Your Price  $54.44
Paperback