Dependency Structures and Lexicalized Grammars: An Algebraic Approach

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Marco Kuhlmann (auth.)
Series: Lecture Notes in Computer Science 6270 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 137
Tags: Artificial Intelligence (incl. Robotics)

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 -