Statistical Learning Models for Japanese Essay Scoring Toward One-shot Learning

Chihiro Ejima, Koichi Takeuchi
{"title":"Statistical Learning Models for Japanese Essay Scoring Toward One-shot Learning","authors":"Chihiro Ejima, Koichi Takeuchi","doi":"10.1109/IIAIAAI55812.2022.00070","DOIUrl":null,"url":null,"abstract":"A lot of studies of automatic essay scoring are conducted using machine learning models. The previous studies show high performance for scoring large scale essays with machine learning models, however, more than hundreds of scored answers are required to train the neural network models. In this paper we discuss the possibility of one-shot learning, that is, using only one model essay as a training sample of a highest score. For this purpose, we apply regression models to estimate essay scores with different embedding models, that are, BERT and bag-of-words based encoding models. In preliminary experiments, feature analyses of one-shot learning with UMAP for the two embedding models reveal that the bag-of-words based model has more potential to score the test essays comparing to the BERT encoding model. Thus, to clarify the performance of the bag-of-words based encoding model, we conduct two experiments: firstly, we evaluate the performance of models to estimate the scores of test essays using 80% of score essays are used as training data; secondly, one-shot learning is applied to the models. The experimental results show that the proposed bag-of-words based encoding model is promising.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIAIAAI55812.2022.00070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A lot of studies of automatic essay scoring are conducted using machine learning models. The previous studies show high performance for scoring large scale essays with machine learning models, however, more than hundreds of scored answers are required to train the neural network models. In this paper we discuss the possibility of one-shot learning, that is, using only one model essay as a training sample of a highest score. For this purpose, we apply regression models to estimate essay scores with different embedding models, that are, BERT and bag-of-words based encoding models. In preliminary experiments, feature analyses of one-shot learning with UMAP for the two embedding models reveal that the bag-of-words based model has more potential to score the test essays comparing to the BERT encoding model. Thus, to clarify the performance of the bag-of-words based encoding model, we conduct two experiments: firstly, we evaluate the performance of models to estimate the scores of test essays using 80% of score essays are used as training data; secondly, one-shot learning is applied to the models. The experimental results show that the proposed bag-of-words based encoding model is promising.
面向一次性学习的日语作文评分统计学习模型
很多关于论文自动评分的研究都是使用机器学习模型进行的。先前的研究表明,使用机器学习模型对大规模文章进行评分具有很高的性能,然而,需要超过数百个得分答案来训练神经网络模型。在本文中,我们讨论了单次学习的可能性,即只使用一个模型文章作为最高分数的训练样本。为此,我们应用回归模型来估计不同嵌入模型的论文分数,即BERT和基于词袋的编码模型。在初步实验中,使用UMAP对两种嵌入模型进行了一次学习的特征分析,结果表明基于词袋的模型比BERT编码模型更有可能对测试文章进行评分。因此,为了明确基于词袋的编码模型的性能,我们进行了两个实验:首先,我们使用80%的分数文章作为训练数据来评估模型的性能,以估计测试文章的分数;其次,对模型进行一次性学习。实验结果表明,所提出的基于词袋的编码模型是很有前途的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信