Pith. sign in

REVIEW 5 major objections 6 minor 30 references

Multilingual Grammatical Error Annotation: Combining Language-Agnostic Framework with Language-Specific Flexibility

T0 review · 5 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read The paper claims that a single modular annotation framework—a language-agnostic Missing/Replacement/Unnecessary core with small per-language extensions, running on Stanza's Universal Dependencies labels—can reproduce errant's English…

desk verdict A solid errant-on-Stanza tool paper with a real English reproduction, but the multilingual accuracy claims outrun the evidence—needs error-level agreement. read the letter →

arxiv 2506.07719 v1 pith:75GAKUXA submitted 2025-06-09 cs.CL

classification cs.CL
keywords grammaticalerrorannotationcorrectionerrantmultilingualMRUframeworkUniversalDependenciesStanzatypology
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that grammatical error annotation—the step that turns an original and a corrected sentence into labeled error types—can be made consistent across typologically diverse languages without giving up language-specific detail. It proposes a two-tier system: a universal core that classifies every edit as Missing, Replacement, or Unnecessary and attaches a part-of-speech label, plus optional modules for language-specific phenomena such as phonetic spelling errors, word order, word boundaries, and (for Korean) postpositions and honorifics. To support the claim, the authors reimplement the standard English errant toolkit on the multilingual Stanza pipeline, reproduce its scores on English ($F_{0.5}$ within 0.0002), then apply the same core to German and Czech with no language-specific code, add light templates for Korean, and retrain the tokenizer for Chinese. If the framework delivers what it claims, GEC systems could be evaluated and compared across many languages under one shared, interpretable annotation scheme instead of a patchwork of incompatible tools.

What carries the argument

The load-bearing mechanism is the separation of the annotation pipeline into a shared alignment-and-classification core and an extensible per-language layer. The alignment core, inherited from errant, uses the linguistically enhanced Damerau-Levenshtein algorithm of Felice et al. (2016) to find edit spans between original and corrected sentences, weighting POS tags, lemmas, and character similarity rather than raw surface distance. The classification core is the MRU scheme: each edit receives one of three operations and a UD-based POS label, producing interpretable labels such as R:NOUN→NOUN or M:PRON. Language-specific extensions sit on top of this core: Algorithm 1 classifies replacement edits into spelling errors (phonetic, shape, or phonographic), R:WO when the same word set appears in a different order, and R:WB when merging tokens yields the same character sequence; Korean adds WB:M and WB:U spacing subtypes plus ADP, PART, and HON morpheme categories; Chinese swaps the segmentation scheme by retraining Stanza on an LTP-annotated treebank. The framework's scalability rests on Stanza's UD-based tokenization, POS tagging, and dependency parsing being available and consistent across target languages.

What would settle it

Run the framework on the first 1000 Czech sentences from Náplava et al. (2022) and the German development set from Boyd (2018), then compare its edits label-by-label against the gold M2 annotations. If per-label agreement is low even where total M/R/U counts match—especially for the most frequent gold categories like Czech DIACR and German DET:FORM—then the universal core is not actually reproducing established annotations; it is only producing similar totals. A second check is to tag uncorrected learner sentences with Stanza and compare against human-corrected POS tags; systematic tag noise on learner text would propagate directly into every downstream error label.

Watch

Extended reading notes

Core claim

The paper's central claim is that a grammatical error annotation framework with a language-agnostic core can match existing per-language errant adaptations while adding cross-linguistic consistency. The core is the MRU scheme: every edit is classified as Missing, Replacement, or Unnecessary and further specified by a Universal-Dependencies-style POS label, so that an edit errant would mark R:VERB:FORM becomes R:VERB→AUX and a missing relative pronoun becomes M:PRON instead of M:OTHER. Around this core sit structured, reusable extension templates—spelling errors divided into phonetic, shape-based, and combined phonographic types, plus word-order and word-boundary errors—which languages can adopt, refine, or replace. The authors demonstrate the claim empirically: the English reimplementation scores $F_{0.5}=0.5503$ versus errant's $0.5501$ on T5 outputs; the generic core applied with no customization to German and Czech yields near-identical operation counts to the existing adaptations (4897 vs 4915 total edits on the first 1000 Czech sentences); Korean needs only small templates for spacing and functional morphemes; and Chinese requires deeper work, retraining Stanza on an LTP-style segmentation to avoid misleading spans such as splitting 为什么 into separate tokens. The intended consequence is a single, interpretable annotation standard that can be rolled out to other languages—including the ten remaining MultiGEC-2025 languages—without re-engineering the pipeline.

Load-bearing premise

The framework assumes that Stanza's off-the-shelf part-of-speech and dependency tags are reliable enough on learner-written text, and rich enough for any language's grammar, that a single rule-based core can produce correct error labels without language-specific classifiers.

Editorial extensions

If this is right

  • The same pipeline, with no further language-specific code, can be applied to the other ten languages in the MultiGEC-2025 corpus, because Stanza already supplies UD tokenization and POS/dependency labels for them.
  • Error distributions and system evaluation scores become directly comparable across languages that share the MRU core, simplifying multilingual GEC benchmarks that today must reconcile incompatible annotation schemes.
  • Systems evaluated with this framework get more diagnostic feedback in some cases—a missing relative pronoun reads as M:PRON rather than M:OTHER, and passive constructions read as R:VERB→AUX—so error-type analysis is more informative than errant's.
  • A new language can adopt the framework incrementally: start with the generic core, add templates for spelling, word order, or word boundaries only where needed, and retrain the tokenizer only if segmentation demands it.
  • Because the framework emits standard M2 format, it can replace errant in existing evaluation workflows without changing the downstream scoring pipeline.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: the real test of the universal core is per-label agreement, not just operation counts; computing label-level precision/recall against the existing Czech, German, and Greek errant-style gold would show whether the framework captures the same errors or merely similar totals.
  • Editorial extension: if Stanza's UD labels hold up on noisy learner text for the full 70+ language set, the architecture becomes a zero-configuration annotator for low-resource GEC languages; a natural first probe would be an agglutinative language like Hungarian or Finnish, which are far from the five demonstrated languages.
  • Editorial extension: the paper's suggestion of mapping its labels onto existing schemes points to an implicit interoperability promise; building those mapping tables would let existing per-language datasets be converted rather than re-annotated, a concrete next deliverable the paper does not itself supply.
  • Editorial extension: the Chinese experiment suggests that tokenization granularity, not classification logic, drives most cross-system disagreement for logographic languages; a testable corollary is that segmenting learner text the way a human would reduces spurious spans and apparent error counts.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 6 minor

Summary. The paper presents a multilingual grammatical error annotation framework that reimplements errant using the Stanza toolkit, combining a language-agnostic MRU (Missing, Replacement, Unnecessary) core with structured language-specific extensions. The authors validate the English reimplementation by comparing T5-based GEC evaluation scores against the original errant, then apply the framework to German, Czech, Korean, and Chinese with varying levels of customization. The central claim is that this design provides consistency and flexibility across typologically diverse languages, enabling accurate and interpretable annotations without requiring full language-specific classifiers for European languages. The paper includes example annotations, operation-count comparisons, and top-label frequency comparisons, but no error-level agreement evaluation against gold annotations or prior adaptations.

Significance. If the framework's claims were fully supported, this would be a practical contribution to multilingual GEC evaluation: a single UD-based pipeline that can be extended to many languages while preserving comparability, with a publicly released codebase. The English reimplementation result is encouraging, reproducing errant's F0.5 to within 0.0002, and the two-tier typology is a sensible design that addresses real fragmentation in existing errant adaptations. However, the paper's cross-lingual validation is currently only at the level of aggregate operation counts and selected examples, which is insufficient to establish that the produced annotations are accurate and interpretable for the claimed range of languages. The explicit limitation statement that 'a detailed analysis of annotation improvements... is left to future work' further indicates that the current evidence is preliminary.

major comments (5)
  1. [§4.2, Tables 2–3] The Czech and German comparisons report only total operation counts and top-10 label frequencies. Two annotation systems can have identical operation counts while disagreeing on nearly every individual edit span and type, so the statement that the framework 'can replicate established annotation distributions' (end of §4.2) is not supported. Please compute edit-level agreement (e.g., precision/recall/F0.5 between the system's edits and the prior adaptations' edits on the same sentences, or Cohen's kappa on aligned edits) and report it alongside the aggregate numbers.
  2. [§4.1, Table 1] The English validation demonstrates similar system-level F0.5 scores between the reimplementation and errant, but this does not directly validate the annotation output. Please report the overlap between the edits produced by the two toolkits on the same system outputs (again, edit-level precision/recall or exact-match agreement), since the paper's goal is annotation quality rather than only evaluation score reproduction.
  3. [§3.2, Algorithm 1] The spelling classification in Algorithm 1 depends on thresholds α1 and α2 for phonetic and shape similarity, but the paper gives no values for these parameters, no description of how they were chosen, and no sensitivity analysis. The entire R:SPELL subtyping rests on these free parameters, and yet no evaluation is provided for the spelling classifier in any language. Please specify the thresholds and validate the spelling subtype decisions against a sample of gold annotations.
  4. [§5, Limitations] The Limitations section states that 'a detailed analysis of annotation improvements... is left to future work,' which directly conflicts with the Conclusion's assertion that the system 'produces accurate and interpretable annotations in English' and 'generate[s] reliable annotations without requiring language-specific classification modules' for European languages. Please either provide the missing quantitative evidence (edit-level agreement, annotation-quality analysis) or explicitly weaken the conclusions to claims of feasibility and promising preliminary consistency, rather than established reliability.
  5. [§4.3–§4.4] The Korean and Chinese applications are presented as demonstrations of flexibility, but they include no quantitative evaluation of annotation quality. For the Chinese case in particular, retraining Stanza on an LTP-style segmentation may affect POS-tagging and dependency-parsing accuracy, yet no measurement of parser quality or downstream annotation consistency is provided. Since these sections are used to support the framework's adaptability across 'typologically diverse languages,' please add at least a small-scale evaluation (e.g., agreement with a manually annotated sample or with existing ChERRANT/KAGAS annotations) or label these sections explicitly as illustrative feasibility studies.
minor comments (6)
  1. [Abstract and §1] The GitHub URL in the abstract (https://github.com/open-writing-evaluation/jp_errant_bea) does not match the URL given in the body text (http://open-writing-evaluation.github.io); please verify that both are the intended project location.
  2. [§4.1, Table 1] The table header lists 'T5' as the system, and the text cites Rothe et al. (2021), but the reference describes 'A Simple Recipe for Multilingual Grammatical Error Correction' rather than specifically naming T5; please clarify the connection between the cited work and the T5 model used.
  3. [Figure 4] The Czech example shows 'R:VERB AUX -> AUX VERB' while the text refers to distinguishing auxiliary and main verbs; using a consistent label format (e.g., arrows and spacing) across the paper would improve readability.
  4. [Figure 6] The figure contains two duplicate 'Correction:' lines with slightly different content (one with pinyin and one without); please remove the redundancy.
  5. [Table 3] The top-10 label lists for Czech and German are presented side-by-side, but the label schemes differ (e.g., 'NOUN→NOUN' vs 'DET→DET' with explicit source-target pairs); please add a note explaining that these are not directly comparable re-labelings, as the text acknowledges, and consider aligning label formats where possible.
  6. [§3.1] The definition of 'Replacement' uses the pattern R:P1→P2, but the MRU core is described as classifying errors into three operations; please clarify how the R:P1→P2 pattern relates to the 'Replacement' category and to the later algorithm in §3.2.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the framework claims are about modular tooling and are not derived from the paper's own outputs.

full rationale

The paper's central claims are engineering and flexibility claims: that a stanza-based reimplementation of errant with a language-agnostic MRU core plus structured extensions can be applied to multiple languages. No numerical prediction is fitted to the reported data and then renamed as a result; the thresholds α1 and α2 in Algorithm 1 are not fitted to Tables 1-3 outputs, and the English validation compares aggregate F0.5 scores against the external errant implementation on T5 outputs, which is an external benchmark rather than a circular input. The Czech and German comparisons in Tables 2 and 3 are against prior external adaptations (Boyd 2018, Náplava et al. 2022), and although operation-count agreement is weak evidence for annotation equivalence, that is an evidence-strength problem, not a circular derivation. Self-citations (Gu et al. 2025, Wang et al. 2025, Qiu et al. 2025) are contextual and are not used to justify the central extensibility claim, so no load-bearing self-citation chain exists. The Limitations section explicitly states that 'A detailed analysis of annotation improvements, including task-specific gains and downstream evaluation effects, is left to future work,' which undercuts the strength of the empirical claims but does not indicate that any result is equivalent to its input by construction.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central claims rely on assumptions about UD adequacy, alignment transfer, Stanza robustness, and prior annotations as a baseline. The two similarity thresholds are free parameters with unspecified values; no new physical or conceptual entities are introduced.

free parameters (2)
  • alpha_1 (phonetic similarity threshold) = not specified
    Algorithm 1 classifies R:SPELL:PHONETIC, R:SPELL:SHAPE, and R:SPELL:PHONOGRAPHIC based on thresholds alpha_1 and alpha_2; no values or fitting procedure are given, yet the thresholds determine the spelling error labels.
  • alpha_2 (visual/shape similarity threshold) = not specified
    Same as alpha_1: the visual similarity threshold in Algorithm 1 controls when a replacement is labeled as a shape-based spelling error, and no value or fitting method is reported.
assumptions (4)
  • domain assumption Universal Dependencies tags provide a cross-linguistically consistent annotation basis for error types.
    Invoked in Section 2.3 and Section 3.1; the claim that a shared UD framework lets all languages be analyzed uniformly is assumed, not validated in the paper.
  • domain assumption errant's linguistically enhanced alignment algorithm transfers to all target languages without modification.
    Used at the core of all annotations (Sections 2.1 and 4.1); no per-language alignment validation is reported, and the algorithm was originally designed for English.
  • domain assumption Stanza's tokenization and POS tagging are adequate for learner text in the five languages.
    The Limitations section admits the tools are not explicitly optimized for noisy or learner-generated text, yet the framework's labels depend on them.
  • domain assumption Prior adapters' annotations (Boyd 2018, Náplava 2022) are trustworthy references for comparison.
    Tables 2 and 3 treat operation counts from prior work as the baseline; if those annotations contain systematic errors, similarity to them does not validate accuracy.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multilingual Grammatical Error Annotation: Combining Language-Agnostic Framework with Language-Specific Flexibility." pith.science (2026). https://pith.science/paper/75GAKUXA

@misc{pith2026250607719,
  author       = {Pith},
  title        = {Pith review of: Multilingual Grammatical Error Annotation: Combining Language-Agnostic Framework with Language-Specific Flexibility},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/75GAKUXA}},
  note         = {Machine review of arXiv:2506.07719}
}
abstract

Grammatical Error Correction (GEC) relies on accurate error annotation and evaluation, yet existing frameworks, such as $\texttt{errant}$, face limitations when extended to typologically diverse languages. In this paper, we introduce a standardized, modular framework for multilingual grammatical error annotation. Our approach combines a language-agnostic foundation with structured language-specific extensions, enabling both consistency and flexibility across languages. We reimplement $\texttt{errant}$ using $\texttt{stanza}$ to support broader multilingual coverage, and demonstrate the framework's adaptability through applications to English, German, Czech, Korean, and Chinese, ranging from general-purpose annotation to more customized linguistic refinements. This work supports scalable and interpretable GEC annotation across languages and promotes more consistent evaluation in multilingual settings. The complete codebase and annotation tools can be accessed at https://github.com/open-writing-evaluation/jp_errant_bea.

Figures

Figures reproduced from arXiv: 2506.07719 by the authors.

Figure 1
Figure 1. Example of an annotated sentence in M2 format from BEA-2019. With edits extracted and categorized in a stan￾dardized format, errant can then be used to sys￾tematically evaluate GEC system outputs against gold-standard references. It calculates precision and recall between system-generated edits and gold-standard corrections and utilizes a harmonic mean F0.5 score, which weights precision twice as much as recall to p… view at source ↗
Figure 2
Figure 2. illustrates representative examples of the three major subtypes of Replacement errors classified by our algorithm. R:SPELL:PHONETIC their → there R:WO You can help me → Can you help me R:WB ice cream → icecream [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 4
Figure 4. Examples of grammatical error annotation for Czech and German [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figures from the paper (2 more)
Figure 5
Figure 5. Figure 5: Examples from the Korean M2 file: I didn’t eat the airplane food (Annotator 0), and The airplane food didn’t agree with me (Annotator 1) 4.4 Integrating deeper customization for Chinese Chinese grammatical error annotation presents unique challenges due to the lack of …
Figure 6
Figure 6. Figure 6: Fragments of grammatical error annotation examples in Chinese with different word boundaries. Incorrect [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

30 extracted references · 18 canonical work pages

  1. [1]

    Riadh Belkebir and Nizar Habash. 2021. https://doi.org/10.18653/v1/2021.conll-1.47 Automatic Error Type Annotation for Arabic . In Proceedings of the 25th Conference on Computational Natural Language Learning, pages 596--606, Online. Association for Computational Linguistics

  2. [2]

    Adriane Boyd. 2018. https://doi.org/10.18653/v1/W18-6111 Using Wikipedia Edits in Low Resource Grammatical Error Correction . In Proceedings of the 2018 EMNLP Workshop W-NUT: The 4th Workshop on Noisy User-generated Text, pages 79--84, Brussels, Belgium. Association for Computational Linguistics

  3. [3]

    Andersen, and Ted Briscoe

    Christopher Bryant, Mariano Felice, Øistein E. Andersen, and Ted Briscoe. 2019. https://doi.org/10.18653/v1/W19-4406 The BEA-2019 Shared Task on Grammatical Error Correction . In Proceedings of the Fourteenth Workshop on Innovative Use of NLP for Building Educational Applications, pages 52--75, Florence, Italy. Association for Computational Linguistics

  4. [4]

    Christopher Bryant, Mariano Felice, and Ted Briscoe. 2017. https://doi.org/10.18653/v1/P17-1074 Automatic Annotation and Evaluation of Error Types for Grammatical Error Correction . In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 793--805, Vancouver, Canada. Association for Computat...

  5. [5]

    Christopher Bryant, Zheng Yuan, Muhammad Reza Qorib, Hannan Cao, Hwee Tou Ng, and Ted Briscoe. 2023. https://doi.org/10.1162/coli \_ a \_ 00478 Grammatical Error Correction: A Survey of the State of the Art . Computational Linguistics, 49(3):643--701

  6. [6]

    Daniel Dahlmeier and Hwee Tou Ng. 2012. https://aclanthology.org/N12-1067 Better Evaluation for Grammatical Error Correction . In Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 568--572, Montr \' e al, Canada. Association for Computational Linguistics

  7. [7]

    Mariano Felice, Christopher Bryant, and Ted Briscoe. 2016. https://www.aclweb.org/anthology/C16-1079 Automatic Extraction of Learner Errors in ESL Sentences Using Linguistically Enhanced Alignments . In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 825--835, Osaka, Japan. The COLING 201...

  8. [8]

    Yang Gu, Zihao Huang, Min Zeng, Mengyang Qiu, and Jungyeul Park. 2025. https://aclanthology.org/2025.coling-main.189/ Improving Automatic Grammatical Error Annotation for Chinese Through Linguistically-Informed Error Typology . In Proceedings of the 31st International Conference on Computational Linguistics, pages 2781--2798, Abu Dhabi, UAE. Association f...

Show all 30 references
  1. [9]

    Charles Hinson, Hen-Hsen Huang, and Hsin-Hsi Chen. 2020. https://doi.org/10.18653/v1/2020.coling-main.199 Heterogeneous Recycle Generation for Chinese Grammatical Error Correction . In Proceedings of the 28th International Conference on Computational Linguistics, pages 2191--2...

  2. [10]

    Katerina Korre, Marita Chatzipanagiotou, and John Pavlopoulos. 2021. https://aclanthology.org/2021.ranlp-1.81/ ELERRANT : Automatic grammatical error type classification for G reek . In Proceedings of the International Conference on Recent Advances in Natural Language Processi...

  3. [11]

    Katerina Korre and John Pavlopoulos. 2020. https://aclanthology.org/2020.latechclfl-1.10/ ERRANT : Assessing and improving grammatical error type classification . In Proceedings of the 4th Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Science...

  4. [12]

    Jenni Marjokorpi. 2023. https://doi.org/10.1007/s11145-022-10405-z The relationship between grammatical understanding and writing skills in finnish secondary l1 education . Reading and Writing, 36(10):2605--2625

  5. [13]

    Arianna Masciolini, Andrew Caines, Orph \'e e De Clercq, Joni Kruijsbergen, Murathan Kurfal , Ricardo Mu \ n oz S \'a nchez, Elena Volodina, and Robert \"O stling. 2025 a . https://aclanthology.org/2025.nlp4call-1.1/ The M ulti GEC -2025 shared task on multilingual grammatical...

  6. [14]

    Arianna Masciolini, Andrew Caines, Orph \'e e De Clercq, Joni Kruijsbergen, Murathan Kurfal , Ricardo Mu \ n oz S \'a nchez, Elena Volodina, Robert \"O stling, Kais Allkivi, S pela Arhar Holdt, et al. 2025 b . https://doi.org/10.1075/ijlcr.24033.mas Towards better language rep...

  7. [15]

    Jakub N \' a plava, Milan Straka, Jana Strakov \' a , and Alexandr Rosen. 2022. https://doi.org/10.1162/tacl \_ a \_ 00470 Czech Grammar Error Correction with a Large and Diverse Corpus . Transactions of the Association for Computational Linguistics, 10:452--467

  8. [16]

    Courtney Napoles, Keisuke Sakaguchi, Matt Post, and Joel Tetreault. 2015. https://doi.org/10.3115/v1/P15-2097 Ground Truth for Grammatical Error Correction Metrics . In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th Internat...

  9. [17]

    Hwee Tou Ng, Siew Mei Wu, Yuanbin Wu, Christian Hadiwinoto, and Joel Tetreault. 2013. https://www.aclweb.org/anthology/W13-3601 The CoNLL-2013 Shared Task on Grammatical Error Correction . In Proceedings of the Seventeenth Conference on Computational Natural Language Learning:...

  10. [18]

    Slav Petrov, Dipanjan Das, and Ryan McDonald. 2012. A Universal Part-of-Speech Tagset . In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC-2012), pages 2089--2096, Istanbul, Turkey. European Language Resources Association (ELRA)

  11. [19]

    Peng Qi, Yuhao Zhang, Yuhui Zhang, Jason Bolton, and Christopher D Manning. 2020. https://doi.org/10.18653/v1/2020.acl-demos.14 Stanza: A Python Natural Language Processing Toolkit for Many Human Languages . In Proceedings of the 58th Annual Meeting of the Association for Comp...

  12. [20]

    Mengyang Qiu, Qingyu Gao, Linxuan Yang, Yang Gu, Tran Minh Nguyen, Zihao Huang, and Jungyeul Park. 2025. https://doi.org/10.48550/arXiv.2504.00977 Chinese grammatical error correction: A survey . arXiv

  13. [21]

    Sascha Rothe, Jonathan Mallinson, Eric Malmi, Sebastian Krause, and Aliaksei Severyn. 2021. https://doi.org/10.18653/v1/2021.acl-short.89 A Simple Recipe for Multilingual Grammatical Error Correction . In Proceedings of the 59th Annual Meeting of the Association for Computatio...

  14. [22]

    Ankur Sonawane, Sujeet Kumar Vishwakarma, Bhavana Srivastava, and Anil Kumar Singh. 2020. https://aclanthology.org/2020.aacl-srw.24 Generating Inflectional Errors for Grammatical Error Correction in Hindi . In Proceedings of the 1st Conference of the Asia-Pacific Chapter of th...

  15. [23]

    Catherine G Van Beuningen, Nivja H De Jong, and Folkert Kuiken. 2012. https://doi.org/10.1111/j.1467-9922.2011.00674.x Evidence on the effectiveness of comprehensive error correction in second language writing . Language Learning, 62(1):1--41

  16. [24]

    Junrui Wang, Mengyang Qiu, Yang Gu, Zihao Huang, and Jungyeul Park. 2025. https://aclanthology.org/2025.coling-main.52/ Refined Evaluation for End-to-End Grammatical Error Correction Using an Alignment-Based Approach . In Proceedings of the 31st International Conference on Com...

  17. [25]

    Soyoung Yoon, Sungjoon Park, Gyuwan Kim, Junhee Cho, Kihyo Park, Gyu Tae Kim, Minjoon Seo, and Alice Oh. 2023. https://aclanthology.org/2023.acl-long.371 Towards standardizing Korean Grammatical Error Correction: Datasets and Annotation . In Proceedings of the 61st Annual Meet...

  18. [26]

    Min Zeng, Jiexin Kuang, Mengyang Qiu, Jayoung Song, and Jungyeul Park. 2024. https://aclanthology.org/2024.lrec-main.569 Evaluating Prompting Strategies for Grammatical Error Correction Based on Language Proficiency . In Proceedings of the 2024 Joint International Conference o...

  19. [27]

    Yue Zhang, Zhenghua Li, Zuyi Bao, Jiacheng Li, Bo Zhang, Chen Li, Fei Huang, and Min Zhang. 2022. https://doi.org/10.18653/v1/2022.naacl-main.227 MuCGEC: a Multi-Reference Multi-Source Evaluation Dataset for Chinese Grammatical Error Correction . In Proceedings of the 2022 Con...

  20. [28]

    Wei Zhao, Liang Wang, Kewei Shen, Ruoyu Jia, and Jingming Liu. 2019. https://www.aclweb.org/anthology/N19-1014 Improving Grammatical Error Correction via Pre-Training a Copy-Augmented Architecture with Unlabeled Data . In Proceedings of the 2019 Conference of the North America...

  21. [29]

    online" 'onlinestring :=

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint eprinttype howpublished institution journal key month note number organization pages publisher school series title type volume year doi pubmed url lastchecked label extra.label sort.label short.list...

  22. [30]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.