找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Dependency Structures and Lexicalized Grammars; An Algebraic Approac Marco Kuhlmann Book 2010 Springer-Verlag Berlin Heidelberg 2010 comput

[复制链接]
查看: 46189|回复: 47
发表于 2025-3-21 17:52:46 | 显示全部楼层 |阅读模式
书目名称Dependency Structures and Lexicalized Grammars
副标题An Algebraic Approac
编辑Marco Kuhlmann
视频video
概述Up to date results.Fast track monograph.State-of-the-art report
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Dependency Structures and Lexicalized Grammars; An Algebraic Approac Marco Kuhlmann Book 2010 Springer-Verlag Berlin Heidelberg 2010 comput
描述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.
出版日期Book 2010
关键词computational linguistics; dependency structures; grammar; lexicalized grammars; linguistics; polynomial
版次1
doihttps://doi.org/10.1007/978-3-642-14568-1
isbn_softcover978-3-642-14567-4
isbn_ebook978-3-642-14568-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2010
The information of publication is updating

书目名称Dependency Structures and Lexicalized Grammars影响因子(影响力)




书目名称Dependency Structures and Lexicalized Grammars影响因子(影响力)学科排名




书目名称Dependency Structures and Lexicalized Grammars网络公开度




书目名称Dependency Structures and Lexicalized Grammars网络公开度学科排名




书目名称Dependency Structures and Lexicalized Grammars被引频次




书目名称Dependency Structures and Lexicalized Grammars被引频次学科排名




书目名称Dependency Structures and Lexicalized Grammars年度引用




书目名称Dependency Structures and Lexicalized Grammars年度引用学科排名




书目名称Dependency Structures and Lexicalized Grammars读者反馈




书目名称Dependency Structures and Lexicalized Grammars读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:24:19 | 显示全部楼层
Maria Spadafora,Mario Rapaccini,Shaun Westroperly decreases expressiveness on nearly all levels of this hierarchy (Section 8.2). Finally, we discuss the complexity of the parsing problem of the string languages generated by regular dependency grammars. In particular, we show that the well-nestedness condition can make the change between tractable and intractable parsing (Section 8.3).
发表于 2025-3-22 02:56:41 | 显示全部楼层
Preliminaries, theory [17]. To describe and manipulate structures and sets of structures, we make use of terms and term languages, and of the usual operations defined on them [28]. Note that we use the word ‘term’ for the syntactic object, and the word ‘tree’ when referring to the order-theoretic and graph-theoretic structures.
发表于 2025-3-22 06:40:51 | 显示全部楼层
Generative Capacity and Parsing Complexity,roperly decreases expressiveness on nearly all levels of this hierarchy (Section 8.2). Finally, we discuss the complexity of the parsing problem of the string languages generated by regular dependency grammars. In particular, we show that the well-nestedness condition can make the change between tractable and intractable parsing (Section 8.3).
发表于 2025-3-22 11:20:54 | 显示全部楼层
Projective Dependency Structures,ent algorithm to test whether a given dependency structure is projective (Section 3.3). We use this algorithm to evaluate the practical relevance of projectivity on data from three dependency treebanks (Section 3.4).
发表于 2025-3-22 13:30:15 | 显示全部楼层
发表于 2025-3-22 18:18:29 | 显示全部楼层
发表于 2025-3-22 21:34:56 | 显示全部楼层
Regular Dependency Languages,utomata and grammars for this class of languages (Section 7.1).We then develop a powerful pumping lemma for regular dependency languages (Section 7.2) and apply it to show that the languages in this class are of constant growth, a property characteristic for mildly context-sensitive languages (Section 7.3).
发表于 2025-3-23 03:26:51 | 显示全部楼层
Book 2010e 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 l
发表于 2025-3-23 07:21:37 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 06:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表