Dòng Nội dung
1
“v+n+n”结构的哈萨克语短语歧义分析与消解 = The “v+n+n” Phrase of Structural Disambiguation in Kazakh / Hu Bing-xin;Gulia Altenbek;QI Hui;College of Information Science and Engineering,Xinjiang University;The Base of Kazakh and Kirghiz Language of National Language Resource Monitoring and Research Center Minority Languages;Xinjiang Laboratory of Multi-language Information Technology;College of Information Science andEngineering,Xinjiang University;College of humanity,Xinjiang University // 语言与翻译 = Language and translation No. 2, 2014.
新疆维吾尔自治区乌鲁木齐市 : 语言文字工作委员会 , 2014.
p. 33-37.

In the recognition process of Kazakh phrases, the phrase structure ambiguity exists. This paper studied a lot of ambiguous phrase structure and analyzed the computer processing format of ambiguity, especially the most common "v+n+n" ambiguous structure. Based on the features of the Kazakh language, this paper used conditional random field(CRF) model to resolve the ambiguity. The experimental results show that the strategy can resolvetheambiguity effectively
2
《(重)标算法》述评 / 张连文. // Foreign Language Teaching and Research 4/2018

tr. 628-633

<正>1.引言加标(labeling)理论(Chomsky 2013,2015)和加标算法(Labeling Algorithm,LA)是当前最简方案研究的前沿理论与核心机制。强势最简论(SMT)聚焦于标签在有效计算原则下的确定机制。基于合并运算和特征一致性的加标算法完善了探测算法(Probing Algorithm,PA),重标(relabeling)算法确定了被选合并项的范畴,优化了生成语法的分析模型。由法国国家科研中心Ceccheto教授

3
《(重新)加标》述评 / 王晓娜, 毛眺源, Carlo Cecchetto... // 当代语言学 = Contemporary Linguistics. 2018/4 - Volume 20
2018.
p. 616-622.

<正>1. 引言《(重新)加标》((Re)labeling)是麻省理工学院出版社2015年出版的语言探索系列丛书之一。该书在最简方案框架下实践"词汇主义"(lexicalism)的要旨, 认为"词"(word)是形态模块向句法模块输送的原子构件, 能够自由地为通过合并运算形成的句法实体(重新)加标((re)label)。立足于此, 该书尝试利用(重新)加标理论解释关系化结构(relativization structures)、孤岛限制