Central Library

Normal view MARC view ISBD view

Dependency Structures and Lexicalized Grammars [electronic resource] : An Algebraic Approach / edited by Marco Kuhlmann.

Contributor(s): Kuhlmann, Marco [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Artificial Intelligence: 6270Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: XII, 137 p. 48 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642145681.Subject(s): Artificial intelligence | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
Preliminaries -- Projective Dependency Structures -- Dependency Structures of Bounded Degree -- Dependency Structures without Crossings -- Structures and Grammars -- Regular Dependency Languages -- Generative Capacity and Parsing Complexity -- Conclusion.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

Preliminaries -- Projective Dependency Structures -- Dependency Structures of Bounded Degree -- Dependency Structures without Crossings -- Structures and Grammars -- Regular Dependency Languages -- Generative Capacity and Parsing Complexity -- Conclusion.

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.

There are no comments for this item.

Log in to your account to post a comment.