IJACMI

Article record

authors
Prakhar Gautam1*, Jitendra Singh Thakur2, Ashish Mishra3
affiliations
1 Research Scholar, Jabalpur Engineering College, Jabalpur, Madhya Pradesh, India
2 Jabalpur Engineering College, Jabalpur, Madhya Pradesh, India
3 Gyan Ganga Institute of Technology & Sciences (GGITS), Jabalpur, Madhya Pradesh, India
corresponding author
Prakhar Gautam — prakhargautam@jecjabalpur.ac.in
pages
55-67
doi
10.5281/zenodo.23076774
received
12 July 2026
revised
20 August 2026
accepted
18 September 2026
published
26 September 2026
keywords
subject–verb agreement; grammatical error detection; dependency parsing; minimal pairs; BLiMP; language-model evaluation; agreement attraction; neuro-symbolic NLP
licence
CC BY 4.0 — authors retain copyright in full
Abstract

Subject–verb agreement (SVA) errors are frequent in learner and machine-generated English, and minimal-pair benchmarks show that language models (LMs) still confuse the agreement controller with an intervening noun. We test whether an explicit, parse-grounded checker is a stronger detector than LM scoring. The proposed Parse-grounded Agreement Consistency Checker (PACC) locates the subject of every finite verb in a dependency parse, reads the verb’s number from its surface form through a morphological lexicon, and flags conflicts. Because off-the-shelf parsers are trained on well-formed text and often misread the very verb that carries the error, PACC adds agreement-neutralised re-parsing (ANR): when the main clause has no analysable finite verb, candidate verbs are replaced one at a time by their number-neutral past-tense form, the sentence is re-parsed, and the original form is checked against the recovered subject. We evaluate on the six English SVA paradigms of BLiMP (6,000 minimal pairs), split once into 1,200 development pairs used for rule design and 4,800 held-out test pairs scored in a single run. On the test pairs, PACC with the medium spaCy parser selected on development data reaches 96.5% pairwise accuracy (95% bootstrap CI 96.0–96.9), against 86.6% (85.7–87.6) for the released GPT-2 scores of the BLiMP authors and 52.0% for a Kneser–Ney 5-gram trained here on 6.0 million tokens. The largest gain is on attractors inside relative clauses (89.4% vs 65.9% for GPT-2). A post-hoc run with a transformer-based parser raises accuracy to 98.1% and relative-clause accuracy to 98.0%, at 51 rather than 670 sentences per second. Used as a stand-alone detector on 9,600 single sentences, PACC reaches F1 = 96.3% at a 2.96% false-positive rate, while per-word LM scores barely separate acceptable from unacceptable sentences (ROC-AUC 0.578 for GPT-2). Ablations show that reading number from the surface form and ANR contribute most. Manual inspection of the remaining errors attributes them to attractor attachment, gaps in irregular-plural morphology, and at least 17 test pairs whose “acceptable” member itself contains an agreement error.

How to cite

Prakhar Gautam, Jitendra Singh Thakur, Ashish Mishra (2026). Parse-Grounded Detection of Subject–Verb Agreement Violations: Agreement-Neutralised Re-parsing versus Language-Model Scoring on BLiMP. International Journal of Advanced Computing and Machine Intelligence (IJACMI), 1(1), pp. 55-67. DOI: 10.5281/zenodo.23076774