Dependency Structures and Lexicalized Grammars An Algebraic Approach /

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. Kuhlmanns thesis lays new theoretical foundations for the s...

Full description

Bibliographic Details
Main Author: Kuhlmann, Marco. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series:Lecture Notes in Computer Science, 6270
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-14568-1
LEADER 02708nam a22004575i 4500
001 11014
003 DE-He213
005 20130725200938.0
007 cr nn 008mamaa
008 100716s2010 gw | s |||| 0|eng d
020 # # |a 9783642145681  |9 978-3-642-14568-1 
024 7 # |a 10.1007/978-3-642-14568-1  |2 doi 
050 # 4 |a Q334-342 
050 # 4 |a TJ210.2-211.495 
072 # 7 |a UYQ  |2 bicssc 
072 # 7 |a TJFM1  |2 bicssc 
072 # 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
100 1 # |a Kuhlmann, Marco.  |e author. 
245 1 0 |a Dependency Structures and Lexicalized Grammars  |b An Algebraic Approach /  |c by Marco Kuhlmann.  |h [electronic resource] : 
264 # 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 # # |a XII, 137p. 48 illus.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
490 1 # |a Lecture Notes in Computer Science,  |v 6270  |x 0302-9743 ; 
520 # # |a 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. 
650 # 0 |a Computer science. 
650 # 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642145674 
830 # 0 |a Lecture Notes in Computer Science,  |v 6270  |x 0302-9743 ; 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-14568-1 
912 # # |a ZDB-2-SCS 
912 # # |a ZDB-2-LNC 
950 # # |a Computer Science (Springer-11645)