UID:
almahu_9947364127102882
Umfang:
XII, 137p. 48 illus.
,
online resource.
ISBN:
9783642145681
Serie:
Lecture Notes in Computer Science, 6270
Inhalt:
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.
Anmerkung:
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 eBooks
Weitere Ausg.:
Printed edition: ISBN 9783642145674
Sprache:
Englisch
Schlagwort(e):
Konferenzschrift
DOI:
10.1007/978-3-642-14568-1
URL:
http://dx.doi.org/10.1007/978-3-642-14568-1
URL:
Volltext
(lizenzpflichtig)
