Jure Leskovec, Percy Liang, Michihiro Yasunaga
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 F 0.5 ) and the supervised setting (+0.5 F 0.5 ).
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.06822")
get_code_for_paper("2109.06822")
have("2109.06822")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.06822.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.06822)
Connect an agent — have() is free.