Parameter
Mehr zum Buch
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.
Buchkauf
Dependency structures and lexicalized grammars, Marco Kuhlmann
- Sprache
- Erscheinungsdatum
- 2010
Lieferung
Zahlungsmethoden
Feedback senden
- Titel
- Dependency structures and lexicalized grammars
- Untertitel
- An Algebraic Approach
- Sprache
- Englisch
- Autor*innen
- Marco Kuhlmann
- Verlag
- Springer
- Erscheinungsdatum
- 2010
- ISBN10
- 3642145671
- ISBN13
- 9783642145674
- Kategorie
- Skripten & Universitätslehrbücher
- Beschreibung
- 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.