Automatic Reflection Level Classification in Hungarian Student Essays
Not on the map. Why?
Abstract (arXiv)
Reflective thinking is a key competency in education, but assessing reflective writing remains a time-consuming and subjective task for education experts. While automated reflective analysis has been explored in several languages, Hungarian language was not researched extensively. In this paper, we present the first comprehensive study on automatic reflection level classification in Hungarian student essays. We used a large, expert-annotated Hungarian dataset consisting of 1,954 reflective essays collected over multiple academic years and labeled on a four-level reflection scale. We investigate two approaches: (1) classical machine learning models using TF-IDF and semantic embedding features, and (2) Hungarian-specific transformer models fine-tuned for document-level reflection classification. To address the strong class imbalance in the dataset, we systematically examine class weighting, oversampling, data augmentation, and alternative loss functions. An extensive ablation study is conducted to analyze the contribution of each modeling and balancing strategy. Our results show that shallow machine learning models with appropriate feature engineering achieve strong overall performance, reaching up to 71% overall score averaged over accuracy, F1-score, and ROC AUC metrics, while transformer-based models achieve slightly lower overall score (68%) averaged over the same metrics, but demonstrate better generalization on minority reflection classes. These findings highlight the continued relevance of classical methods for low-resource settings and the robustness of transformer models for imbalanced classification. The proposed dataset and experimental insights provide a solid foundation for future research on automated reflective analysis in Hungarian and other morphologically rich languages.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 77 references that are in the map. First posted on arXiv 4 May 2026.
Builds on
12 of 77 references.
References · 12
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,935
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2018Deep contextualized word representationscited by 2,290
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2022Democratizing Neural Machine Translation with OPUS-MTcited by 58
- 2023Breaking the Token Barrier: Chunking and Convolution for Efficient Long Text Classification with BERTcited by 6
- 2024Text mining in educationcited by 4
- 2023Overview of AdaBoost : Reconciling its views to better understand its dynamicscited by 3
- 2017MEBoost: Mixing Estimators with Boosting for Imbalanced Data Classificationcited by 1
- 2023PapagAI:Automated Feedback for Reflective Essayscited by 1
Built on by
Not cited yet.