找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 淹沒
51#
發(fā)表于 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
52#
發(fā)表于 2025-3-30 16:19:13 | 只看該作者
53#
發(fā)表于 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.
54#
發(fā)表于 2025-3-30 20:58:17 | 只看該作者
55#
發(fā)表于 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
56#
發(fā)表于 2025-3-31 06:27:43 | 只看該作者
57#
發(fā)表于 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
58#
發(fā)表于 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
59#
發(fā)表于 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
60#
發(fā)表于 2025-4-1 00:46:42 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-15 04:17
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
贺州市| 观塘区| 游戏| 长治市| 宝清县| 台北县| 宜黄县| 连平县| 横山县| 旬阳县| 芒康县| 潮安县| 醴陵市| 乐业县| 隆林| 香格里拉县| 聂拉木县| 常熟市| 游戏| 达孜县| 郓城县| 明溪县| 高雄市| 金门县| 措美县| 河曲县| 廉江市| 沾化县| 大名县| 泽库县| 绥芬河市| 翁源县| 岐山县| 昭苏县| 海林市| 三明市| 德惠市| 九龙城区| 吴堡县| 平南县| 临桂县|