arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.07602cs.CL
收藏

UnibucKernel:一种基于核的复杂词识别方法

UnibucKernel: A kernel-based learning method for complex word identification

University of Bucharest(布加勒斯特大学);Department of Computer Science(计算机科学系)

Andrei M. Butnaru, Radu Tudor Ionescu

摘要:

在本文中,我们为2018年复杂词识别(CWI)共享任务提出了一种基于内核的学习方法。我们的方法是基于结合多个低级别的功能,如字符n-grams,与高级语义功能,无论是自动学习使用词嵌入或提取的词汇知识库,即WordNet。在特征提取之后,我们在学习阶段采用核方法。首先将特征矩阵变换为归一化核矩阵。对于二元分类任务(简单与复杂),我们采用支持向量机。对于回归任务,我们必须预测一个词的复杂程度(如果一个词被更多的注释者标记为复杂,那么它就更复杂),我们使用v-Support Vector Regression。我们应用我们的方法只对三个英文数据集包含来自维基百科,维基新闻和新闻领域的文件。我们在比赛中的最好成绩是英文维基百科数据集的第三名。然而,在本文中,我们也报告了更好的赛后结果。

英文摘要:

In this paper, we present a kernel-based learning approach for the 2018 Complex Word Identification (CWI) Shared Task. Our approach is based on combining multiple low-level features, such as character n-grams, with high-level semantic features that are either automatically learned using word embeddings or extracted from a lexical knowledge base, namely WordNet. After feature extraction, we employ a kernel method for the learning phase. The feature matrix is first transformed into a normalized kernel matrix. For the binary classification task (simple versus complex), we employ Support Vector Machines. For the regression task, in which we have to predict the complexity level of a word (a word is more complex if it is labeled as complex by more annotators), we employ v-Support Vector Regression. We applied our approach only on the three English data sets containing documents from Wikipedia, WikiNews and News domains. Our best result during the competition was the third place on the English Wikipedia data set. However, in this paper, we also report better post-competition results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑