Dependency structures and lexicalized grammars. An algebraic approach (Q983734)

From MaRDI portal





scientific article; zbMATH DE number 5760472
Language Label Description Also known as
default for all languages
No label defined
    English
    Dependency structures and lexicalized grammars. An algebraic approach
    scientific article; zbMATH DE number 5760472

      Statements

      Dependency structures and lexicalized grammars. An algebraic approach (English)
      0 references
      0 references
      24 July 2010
      0 references
      Publisher's description: 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.
      0 references
      computational linguistics
      0 references
      dependencies in natural language
      0 references
      long-distance dependencies
      0 references
      free word order
      0 references
      non-projective dependency grammar
      0 references
      phrase-structure grammar
      0 references
      tree-adjoining grammar
      0 references
      polynomial parsing algorithm
      0 references
      dependency language hierarchy
      0 references
      formal language
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references