arXiv AI

Don't Count the Edits, Judge by the Outcome Alone: Reward-Based Evaluation for Grammatical Error Correction

arXiv AI
Jun 2

CSRP: Chain-of-Thought Reasoning for Chinese Text Correction via Reinforcement Learning with Efficiency-Aware Rewards

arXiv:2606. 00020v1 Announce Type: cross Abstract: Large Language Model (LLM) based Chinese Grammatical Error Correction (CGEC) systems face two critical challenges: general-purpose models lack specialized linguistic priors for subtle grammatical distinctions, and Supervised Fine-Tuning (SFT) with Maximum Likelihood Estimation fails to optimize for precision-focused metrics, leading to systematic over-correction.

By Wei Tian, Yuhao Zhou, Man Lan
arXiv Computation and Language
Sep 11

Larger Context Window, Fewer Overcorrections: Optimizing Prompts and Batching for Minimal-Edit Grammatical Error Correction

The paper presents a prompt-based method for minimal-edit grammatical error correction (GEC) that reduces overcorrection in large language models (LLMs). It introduces taxonomy-based instructions, batch prompting to regularize overcorrection, and LLM-assisted prompt optimization, achieving an $F_{0.5}$ score of 78.32 on BEA-2019 with Gemini 3.1-Pro. This approach narrows the performance gap to fine-tuned models while avoiding their infrastructure demands.

By Kateryna Karpo, Artem Chernodub
arXiv Computation and Language
Nov 2

Precision--Recall Trade-off on the Inference Level for LLMs in Grammatical Error Correction

The paper examines how large language models (LLMs) can be tuned for grammatical error correction (GEC) by adjusting inference-time parameters. It demonstrates that the repetition penalty can be used to control the precision–recall trade-off during decoding, without changing the model architecture, training, or prompt. Experiments on standard GEC benchmarks confirm that this simple, broadly applicable method allows inference-time adjustment of the precision–recall balance, similar to prior sequence‑to‑sequence techniques such as Align‑and‑Predict Decoding.

By Ryszard Staruch, Filip Grali\'nski
arXiv Machine Learning
Oct 19

Causal Edit Serialization

Causal Edit Serialization (CES) is a framework that enables autoregressive language models to perform revisions—such as insertion, deletion, replacement, copying, and movement—within the same causal token stream. CES uses special pointer tokens paired with predicted source addresses, a lightweight localization head, and dual-index rotary position encoding to localize edits while preserving standard causal attention. Experiments show that CES models can execute complete edits with only a modest increase in clean-text bits per byte, and that post‑training with supervised or reinforcement learning can produce beneficial grammatical error corrections.

By Louis Robinson