arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.08349cs.CL
收藏

字符串内核能通过母语识别的时间考验吗?

Can string kernels pass the test of time in Native Language Identification?

University of Bucharest(布加勒斯特大学)

Radu Tudor Ionescu, Marius Popescu

摘要:

我们描述了一种用于2017年母语识别(NLI)共享任务的机器学习方法。所提出的方法结合了多个内核使用多核学习。虽然我们的大多数内核都基于从论文或语音记录中提取的字符p-gram(也称为n-gram),但我们也使用基于i-vector的内核,i-vector是共享任务组织者提供的音频记录的低维表示。对于学习阶段,我们选择核判别分析(KDA)而不是核岭回归(KRR),因为前者的分类器在开发集上获得了比后者更好的结果。在我们以前的工作中,我们使用了类似的机器学习方法来实现最先进的NLI结果。本文的目标是证明我们基于字符串内核的肤浅而简单的方法(略有改进)可以通过时间的考验,并在2017年NLI共享任务中达到最先进的性能,尽管自然语言处理最近取得了进展。我们参加了所有三个轨道,其中允许竞争对手只使用论文(论文轨道),只使用演讲稿(演讲轨道),或两者兼而有之(融合轨道)。仅使用组织者提供的数据来训练我们的模型,我们在封闭的论文轨道中达到了86.95%的宏观F1分数,在封闭的演讲轨道中达到了87.55%的宏观F1分数,在封闭的融合轨道中达到了93.19%的宏观F1分数。凭借这些分数,我们的团队(UnibucKernel)在所有三个曲目中均名列第一组,同时在演讲和融合曲目中获得了最好的分数。

英文摘要:

We describe a machine learning approach for the 2017 shared task on Native Language Identification (NLI). The proposed approach combines several kernels using multiple kernel learning. While most of our kernels are based on character p-grams (also known as n-grams) extracted from essays or speech transcripts, we also use a kernel based on i-vectors, a low-dimensional representation of audio recordings, provided by the shared task organizers. For the learning stage, we choose Kernel Discriminant Analysis (KDA) over Kernel Ridge Regression (KRR), because the former classifier obtains better results than the latter one on the development set. In our previous work, we have used a similar machine learning approach to achieve state-of-the-art NLI results. The goal of this paper is to demonstrate that our shallow and simple approach based on string kernels (with minor improvements) can pass the test of time and reach state-of-the-art performance in the 2017 NLI shared task, despite the recent advances in natural language processing. We participated in all three tracks, in which the competitors were allowed to use only the essays (essay track), only the speech transcripts (speech track), or both (fusion track). Using only the data provided by the organizers for training our models, we have reached a macro F1 score of 86.95% in the closed essay track, a macro F1 score of 87.55% in the closed speech track, and a macro F1 score of 93.19% in the closed fusion track. With these scores, our team (UnibucKernel) ranked in the first group of teams in all three tracks, while attaining the best scores in the speech and the fusion tracks.

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

↑