Cantitate/Preț
Produs

Dependency Structures and Lexicalized Grammars: An Algebraic Approach: Lecture Notes in Computer Science, cartea 6270

Editat de Marco Kuhlmann
en Limba Engleză Paperback – 30 iul 2010
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32628 lei

Preț vechi: 40785 lei
-20% Nou

Puncte Express: 489

Preț estimativ în valută:
6243 6536$ 5166£

Carte tipărită la comandă

Livrare economică 05-19 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642145674
ISBN-10: 3642145671
Pagini: 152
Ilustrații: XII, 137 p. 48 illus.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.25 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Up to date results Fast track monograph State-of-the-art report