找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Human Language Technology. Challenges of the Information Society; Third Language and T Zygmunt Vetulani,Hans Uszkoreit Conference proceedin

[复制链接]
楼主: 淹没
发表于 2025-3-30 11:50:19 | 显示全部楼层
Syntactic Spreadsheets: In Search for a Human-Readable Representation of Parse Tree Forests generated by Świdziński’s grammar, the representation can be used for any grammar handled by Woliński’s Birnam parser, and the basic ideas can be applied to any Immediate Constituent grammar. Syntactic spreadsheets can serve several purposes. They can be simply included in printed publications or d
发表于 2025-3-30 16:19:13 | 显示全部楼层
发表于 2025-3-30 16:39:38 | 显示全部楼层
Spejd: A Shallow Processing and Morphological Disambiguation Toolcase of other shallow parsing formalisms, the rules of the grammar allow for explicit morphosyntactic disambiguation statements, independently of structure-building statements, which facilitates the task of the shallow parsing of morphosyntactically ambiguous or erroneously disambiguated input.
发表于 2025-3-30 20:58:17 | 显示全部楼层
发表于 2025-3-31 02:23:53 | 显示全部楼层
A Measure of the Number of True Analogies between Chunks in Japaneseanalogies between chunks in a language with case markers, Japanese. On a bicorpus of 20,000 sentences, we show that at least 96% of the analogies of form between chunks are also analogies of meaning, thus reporting the presence of at least two million true analogies between chunks in this corpus. As
发表于 2025-3-31 06:27:43 | 显示全部楼层
发表于 2025-3-31 10:25:48 | 显示全部楼层
Mining Parsing Results for Lexical Correction: Toward a Complete Correction Process of Wide-Coverageis an intricate and demanding task. We introduce a automatic process for detecting missing, incomplete and erroneous entries in a morphological and syntactic lexicon, and for suggesting corrections hypotheses for these entries. The detection of dubious lexical entries is tackled by two different tec
发表于 2025-3-31 14:12:24 | 显示全部楼层
Efficient Parsing Using Recursive Transition Networks with Outputsive transition networks with string output (RTNSO). RTNSO-based grammars can be semiautomatically built from samples of a manually built syntactic lexicon. Efficient parsing algorithms are needed to minimize the temporal cost associated to the size of the resulting networks. We focus our algorithms
发表于 2025-3-31 20:06:42 | 显示全部楼层
Automatically Determining Attitude Type and Force for Sentiment Analysisis. Such methods, however, require the construction of large and complex lexicons, giving values for multiple sentiment-related attributes to many different lexical items. For example, a key attribute is what type of . is expressed by a lexical item; e.g., . expresses appreciation of an object’s qua
发表于 2025-4-1 00:46:42 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 00:35
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表