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.
Spell check is a useful application which processes noisy human-generated text. Spell check for Chinese poses unresolved problems due to the large number of characters, the sparse distribution of errors, and the dearth of resources with sufficient coverage of heterogeneous and shifting error domains. For Chinese spell check, filtering using confusion sets narrows the search space and makes finding corrections easier. However, most, if not all, confusion sets used to date are fixed and thus do not include new, shifting error domains. We propose a scalable adaptable filter that exploits hierarchical character embeddings to (1) obviate the need to handcraft confusion sets, and (2) resolve sparsity problems related to infrequent errors. Our approach compares favorably with competitive baselines and obtains SOTA results on the 2014 and 2015 Chinese Spelling Check Bake-off datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2008.12281")
get_code_for_paper("2008.12281")
have("2008.12281")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2008.12281.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2008.12281)
Connect an agent — have() is free.