aiqbench analysis
This research introduces SURE, a novel reward-based evaluation framework designed to overcome the limitations of traditional reference-dependent metrics in grammatical error correction. By leveraging source-conditioned preferences, the model effectively distinguishes valid rewrites from errors across dimensions like faithfulness and fluency without relying on gold standard edits. This advancement represents a significant step toward more robust and flexible assessment methods for natural language processing models.
Don't Count the Edits, Judge by the Outcome Alone: Reward-Based Evaluation for Grammatical Error Correction
arXiv:2609.15559v1 Announce Type: cross Abstract: Grammatical error correction (GEC) evaluation has traditionally relied on reference or edit overlap, which can penalize valid rewrites that differ from gold corrections. Reference-free metrics reduce this dependence, but evaluating whether a fluent output is a valid correction of the source remains challenging. We propose SURE, a source-conditioned reward evaluator trained on within-source preferences spanning minimal-edit and rewrite-oriented corrections. SURE jointly learns an overall reward with criteria-level supervision for grammaticality, faithfulness, and fluency, together with span-level grounding for source-side error resolution. Experiments on SEEDA show that SURE performs competitively against strong baselines, with particular gains on rewrite-style corrections and more disentangled criteria-level diagnostics. Our code is available at https://github.com/hayeonggg/SURE.
Abstract:Grammatical error correction (GEC) evaluation has traditionally relied on reference or edit overlap, which can penalize valid rewrites that differ from gold corrections. Reference-free metrics reduce this dependence, but evaluating whether a fluent output is a valid correction of the source remains challenging. We propose SURE, a source-conditioned reward evaluator trained on within-source preferences spanning minimal-edit and rewrite-oriented corrections. SURE jointly learns an overall reward with criteria-level supervision for grammaticality, faithfulness, and fluency, together with span-level grounding for source-side error resolution. Experiments on SEEDA show that SURE performs competitively against strong baselines, with particular gains on rewrite-style corrections and more disentangled criteria-level diagnostics. Our code is available at this https URL.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
arXiv:2609.15559 [cs.CL]
(or arXiv:2609.15559v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.15559 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 209 words
Related coverage

Hint-based CoT faithfulness evals still mostly work on Claude
LessWrong · Jul 30, 2026

Reviewing failure modes in science as we prepare for AI researchers
LessWrong · Oct 8, 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · Sep 18, 2026

Deconfusing Corrigibility
AI Alignment Forum · Oct 17, 2026