{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/lm-critic-language-models-for-unsupervised","title":"LM-Critic: Language Models for Unsupervised Grammatical Error Correction","arxiv_id":"2109.06822","date":"2021-09-14","proceeding":"EMNLP 2021 11","authors":["Michihiro Yasunaga","Jure Leskovec","Percy Liang"],"abstract":"Training a model for grammatical error correction (GEC) requires a set of labeled ungrammatical / grammatical sentence pairs, but manually annotating such pairs can be expensive. Recently, the Break-It-Fix-It (BIFI) framework has demonstrated strong results on learning to repair a broken program without any labeled examples, but this relies on a perfect critic (e.g., a compiler) that returns whether an example is valid or not, which does not exist for the GEC task. In this work, we show how to leverage a pretrained language model (LM) in defining an LM-Critic, which judges a sentence to be grammatical if the LM assigns it a higher probability than its local perturbations. We apply this LM-Critic and BIFI along with a large set of unlabeled sentences to bootstrap realistic ungrammatical / grammatical pairs for training a corrector. We evaluate our approach on GEC datasets across multiple domains (CoNLL-2014, BEA-2019, GMEG-wiki and GMEG-yahoo) and show that it outperforms existing methods in both the unsupervised setting (+7.7 F0.5) and the supervised setting (+0.5 F0.5).","url_abs":"https://arxiv.org/abs/2109.06822v2","url_pdf":"https://arxiv.org/pdf/2109.06822v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"lm-critic-language-models-for-unsupervised","repo_url":"https://github.com/michiyasunaga/LM-Critic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"lm-critic-language-models-for-unsupervised","repo_url":"https://github.com/elaynelemos/gector-api","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"lm-critic-language-models-for-unsupervised","repo_url":"https://github.com/grammarly/gector","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"grammatical-error-correction","task_name":"Grammatical Error Correction"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":null,"task_name":"valid"}],"methods":[{"method_slug":"repair","method_name":"Repair"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/grammatical-error-correction-on-bea-2019-test","task":"Grammatical Error Correction","dataset":"BEA-2019 (test)","model":"LM-Critic","rank_in_archive_order":12,"of":19,"metrics":{"F0.5":"72.9"},"uses_additional_data":false},{"leaderboard":"/sota/grammatical-error-correction-on-conll-2014","task":"Grammatical Error Correction","dataset":"CoNLL-2014 Shared Task","model":"LM-Critic","rank_in_archive_order":11,"of":23,"metrics":{"F0.5":"65.8"},"uses_additional_data":false},{"leaderboard":"/sota/grammatical-error-correction-on-restricted","task":"Grammatical Error Correction","dataset":"Restricted","model":"+ BIFI with no critic","rank_in_archive_order":4,"of":4,"metrics":{"F0.5":"18.7"},"uses_additional_data":false},{"leaderboard":"/sota/grammatical-error-correction-on-unrestricted","task":"Grammatical Error Correction","dataset":"Unrestricted","model":"+ BIFI (ours)","rank_in_archive_order":2,"of":3,"metrics":{"F0.5":"42.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2109.06822","atlas_url":"https://app.syntology.ai/?focus=2109.06822","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2109.06822"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2109.06822\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2109.06822"},"call":"get_concepts_for_paper(arxiv_id=\"2109.06822\")"}],"by_repo":[{"repo":"michiyasunaga/LM-Critic","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"elaynelemos/gector-api","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"grammarly/gector","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2005.12592"],"harvested_for_calls":[{"arxiv_id":"2005.12592","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2005.12592"},"call":"get_harvested_code_for_paper(arxiv_id=\"2005.12592\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fb1e1b1df4802ed4177ec03f29483dab9d1a198575102731e5d8d9a71b7f3c22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}