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

伪标签是你所需要的

Pseudo-Labels Are All You Need

deepset(deepset公司)

Bogdan Kostić, Mathis Lucka, Julian Risch

摘要:

为读者自动估计文本的复杂度具有多种应用,例如向语言学习者推荐具有适当复杂度水平的文本或支持对文本简化方法的评估。在本文中,我们提交了我们对2022年文本复杂度DE挑战的提交,这是一个回归任务,其目标是为B级德语学习者预测德语句子的复杂度。我们的方法依赖于从德语维基百科和其他语料库创建的超过220,000个伪标签来训练基于Transformer的模型,并且避免任何特征工程或任何额外的标记数据。我们发现,基于伪标签的方法给出了令人印象深刻的结果,但几乎不需要调整的特定任务,因此可以很容易地适应其他领域和任务。

英文摘要:

Automatically estimating the complexity of texts for readers has a variety of applications, such as recommending texts with an appropriate complexity level to language learners or supporting the evaluation of text simplification approaches. In this paper, we present our submission to the Text Complexity DE Challenge 2022, a regression task where the goal is to predict the complexity of a German sentence for German learners at level B. Our approach relies on more than 220,000 pseudo-labels created from the German Wikipedia and other corpora to train Transformer-based models, and refrains from any feature engineering or any additional, labeled data. We find that the pseudo-label-based approach gives impressive results yet requires little to no adjustment to the specific task and therefore could be easily adapted to other domains and tasks.

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

↑