找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reversible Grammar in Natural Language Processing; Tomek Strzalkowski Book 1994 Springer Science+Business Media Dordrecht 1994 Parsing.com

[复制链接]
查看: 18317|回复: 56
发表于 2025-3-21 16:33:01 | 显示全部楼层 |阅读模式
书目名称Reversible Grammar in Natural Language Processing
编辑Tomek Strzalkowski
视频video
丛书名称The Springer International Series in Engineering and Computer Science
图书封面Titlebook: Reversible Grammar in Natural Language Processing;  Tomek Strzalkowski Book 1994 Springer Science+Business Media Dordrecht 1994 Parsing.com
描述Reversible grammar allows computational models to be built thatare equally well suited for the analysis and generation of naturallanguage utterances. This task can be viewed from very differentperspectives by theoretical and computational linguists, and computerscientists. The papers in this volume present a broad range ofapproaches to reversible, bi-directional, and non-directional grammarsystems that have emerged in recent years. This is also the firstcollection entirely devoted to the problems of reversibility innatural language processing. .Most papers collected in this volume are derived from presentations ata workshop held at the University of California at Berkeley in thesummer of 1991 organised under the auspices of the Association forComputational Linguistics. .This book will be a valuable reference to researchers in linguisticsand computer science with interests in computational linguistics,natural language processing, and machine translation, as well as inpractical aspects of computability. .
出版日期Book 1994
关键词Parsing; computability; computational linguistics; computer; computer science; logic; machine translation
版次1
doihttps://doi.org/10.1007/978-1-4615-2722-0
isbn_softcover978-1-4613-6173-2
isbn_ebook978-1-4615-2722-0Series ISSN 0893-3405
issn_series 0893-3405
copyrightSpringer Science+Business Media Dordrecht 1994
The information of publication is updating

书目名称Reversible Grammar in Natural Language Processing影响因子(影响力)




书目名称Reversible Grammar in Natural Language Processing影响因子(影响力)学科排名




书目名称Reversible Grammar in Natural Language Processing网络公开度




书目名称Reversible Grammar in Natural Language Processing网络公开度学科排名




书目名称Reversible Grammar in Natural Language Processing被引频次




书目名称Reversible Grammar in Natural Language Processing被引频次学科排名




书目名称Reversible Grammar in Natural Language Processing年度引用




书目名称Reversible Grammar in Natural Language Processing年度引用学科排名




书目名称Reversible Grammar in Natural Language Processing读者反馈




书目名称Reversible Grammar in Natural Language Processing读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:29:35 | 显示全部楼层
Inherently Reversible Grammars,ne hand, we explain why grammars specified as definite programs (or the various related "unification grammars") lead to uniformity of implementation. On the other hand, we define different intrinsic reversibility properties for such grammars—the most important being finite.which says that both parsi
发表于 2025-3-22 00:41:22 | 显示全部楼层
发表于 2025-3-22 08:17:57 | 显示全部楼层
发表于 2025-3-22 09:25:31 | 显示全部楼层
发表于 2025-3-22 14:16:21 | 显示全部楼层
,Common Heuristics for Parsing, Generation, and Whatever …,euristics are totally independent of specific domains (such as syntax and semantics) and tasks (such as parsing and generation). Efficient computation for parsing and generating sentences automatically emerge thereof, capturing the essence of standard parsing procedures and semantic head-driven gene
发表于 2025-3-22 20:28:32 | 显示全部楼层
Compiling Trace & Unification Grammar,d ideas of Government & Binding Theory (GB). A grammar compiler is presented that transforms a grammar written in the TUG formalism into two different forms, one being useful for parsing, the other being useful for generation.
发表于 2025-3-22 21:29:45 | 显示全部楼层
A General Computational Method for Grammar Inversion,t defines. For example, a directive .,. would assign, depending upon the binding status of its arguments, the representation .,.,. to the sentence ., or it would produce one of the several possible paraphrases of this sentence given its representation. Building such bi-directional systems has long b
发表于 2025-3-23 01:28:46 | 显示全部楼层
Bi-Directional Preferences,r consideration. It examines various properties that the heuristics must have in order to produce coherent and efficient rankings, and presents ways of combining rankings into more complex preferences. Finally, it considers the issues that arise when heuristics are used bi-directionally by both the
发表于 2025-3-23 06:18:03 | 显示全部楼层
Handling Syntactic Alternatives in a Reversible Grammar,ccount. During parsing, the style may be extracted and used by the system, or, it can be ignored if only the denotational semantics of the sentence is needed.When the same grammar is to be used for generation as well, the syntactic style must be selected to fit in with the current discourse situatio
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 18:08
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表