CheckEval: A reliable LLM-as-a-Judge framework for evaluating text generation using checklists
Yukyung Lee, Joonghoon Kim, Jaehee Kim, Hyowon Cho, Jaewook Kang, Pilsung Kang, Najoung Kim
TL;DR
This work tackles the reliability shortcomings of LLM-based text-evaluation by introducing CheckEval, a three-stage framework that decomposes evaluation into fine-grained, binary yes/no checklist questions. Seed questions are expanded via independent augmentation ( diversification and elaboration) and pruned through filtering to ensure alignment with benchmark objectives. Evaluations across SummEval and Topical-Chat with 12 evaluator models show CheckEval achieving higher correlation with human judgments and significantly better inter-evaluator agreement, while also offering increased interpretability through traceable checklist responses. The results indicate CheckEval as a scalable, reliable, and explainable alternative to Likert-scale LLM evaluators for NLG tasks, with future directions including automated checklist design and broader task applicability.
Abstract
Existing LLM-as-a-Judge approaches for evaluating text generation suffer from rating inconsistencies, with low agreement and high rating variance across different evaluator models. We attribute this to subjective evaluation criteria combined with Likert scale scoring in existing protocols. To address this issue, we introduce CheckEval, a checklist-based evaluation framework that improves rating reliability via decomposed binary questions. Through experiments with 12 evaluator models across multiple datasets, we first demonstrate that CheckEval strongly correlates with human judgments. More importantly, CheckEval dramatically improves the average agreement across evaluator models by 0.45 and reduces the score variance. CheckEval scores furthermore have the benefit of being more interpretable because it decomposes evaluation criteria into traceable binary decisions, allowing analyses of specific attributes driving quality judgments.
