2013 · 122 citations · 28 references
ComputingComputer ScienceComputational LinguisticsMachine LearningNatural Language ProcessingAutomated Essay ScoringWriting AssessmentClassification LossEssay ClassificationHuman Agreement ModelingLearning To Rank Loss Functions
Previous approaches for automated essay scoring (AES) learn a rating model by minimizing either the classification, regression, or pairwise classification loss, depending on the learning algorithm used.In this paper, we argue that the current AES systems can be further improved by taking into account the agreement between human and machine raters.To this end, we propose a rankbased approach that utilizes listwise learning to rank algorithms for learning a rating model, where the agreement between the human and machine raters is directly incorporated into the loss function.Various linguistic and statistical features are utilized to facilitate the learning algorithms.Experiments on the publicly available English essay dataset, Automated Student Assessment Prize (ASAP), show that our proposed approach outperforms the state-of-the-art algorithms, and achieves performance comparable to professional human raters, which suggests the effectiveness of our proposed method for automated essay scoring.
28
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
Accurate unlexicalized parsing
Dan Klein, Christopher D. Manning · 2003 · 3.1K citations · Full text
Language Studies, Computer Science, Computational Linguistics +13
Feature-rich part-of-speech tagging with a cyclic dependency network
Kristina Toutanova, Dan Klein, Christopher D. Manning et al. · 2003 · 2.9K citations · Full text