000 03036nam a22004815i 4500
001 978-3-642-14568-1
003 DE-He213
005 20160624102146.0
007 cr nn 008mamaa
008 100716s2010 gw | s |||| 0|eng d
020 _a9783642145681
_9978-3-642-14568-1
024 7 _a10.1007/978-3-642-14568-1
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
100 1 _aKuhlmann, Marco.
_eauthor.
245 1 0 _aDependency Structures and Lexicalized Grammars
_h[electronic resource] :
_bAn Algebraic Approach /
_cby Marco Kuhlmann.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXII, 137p. 48 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6270
505 0 _aPreliminaries -- Projective Dependency Structures -- Dependency Structures of Bounded Degree -- Dependency Structures without Crossings -- Structures and Grammars -- Regular Dependency Languages -- Generative Capacity and Parsing Complexity -- Conclusion.
520 _aSince 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642145674
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6270
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-14568-1
942 _2EBK9176
_cEBK
999 _c38470
_d38470