Dependency Structures and Lexicalized Grammars (Record no. 38470)

000 -LEADER
fixed length control field 03036nam a22004815i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783642145681
-- 978-3-642-14568-1
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 006.3
100 1# - MAIN ENTRY--AUTHOR NAME
Personal name Kuhlmann, Marco.
245 10 - TITLE STATEMENT
Title Dependency Structures and Lexicalized Grammars
Sub Title An Algebraic Approach /
Statement of responsibility, etc by Marco Kuhlmann.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2010.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 137p. 48 illus.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Artificial Intelligence (incl. Robotics).
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-14568-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK9176 http://dx.doi.org/10.1007/978-3-642-14568-1 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha