Dependency Structures and Lexicalized Grammars: An Algebraic Approach

✍ Scribed by Marco Kuhlmann (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2010
• Tongue: English
• Leaves: 144
• Series: Lecture Notes in Computer Science 6270 : Lecture Notes in Artificial Intelligence
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages -
Introduction....Pages 1-10
Preliminaries....Pages 11-15
Projective Dependency Structures....Pages 17-32
Dependency Structures of Bounded Degree....Pages 33-49
Dependency Structures without Crossings....Pages 51-62
Structures and Grammars....Pages 63-83
Regular Dependency Languages....Pages 85-102
Generative Capacity and Parsing Complexity....Pages 103-120
Conclusion....Pages 121-125
Back Matter....Pages -

✦ Subjects

Artificial Intelligence (incl. Robotics)