Dependency Structures and Lexicalized Grammars [recurso electrónico] : An Algebraic Approach / by Marco Kuhlmann.

Por: Kuhlmann, Marco [author.]Colaborador(es): SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 6270Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: XII, 137p. 48 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642145681Tema(s): Computer science | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics)Formatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q334-342TJ210.2-211.495Recursos en línea: Libro electrónicoTexto
Contenidos:
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.
En: Springer eBooksResumen: 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.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos Q334 -342 (Browse shelf(Abre debajo)) 1 No para préstamo 374800-2001

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.

19

Con tecnología Koha