A Simple yet Effective Training-free Prompt-free Approach to Chinese Spelling Correction Based on Large Language Models
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914965504393216 |
|---|---|
| author | Zhou, Houquan Li, Zhenghua Zhang, Bo Li, Chen Lai, Shaopeng Zhang, Ji Huang, Fei Zhang, Min |
| author_facet | Zhou, Houquan Li, Zhenghua Zhang, Bo Li, Chen Lai, Shaopeng Zhang, Ji Huang, Fei Zhang, Min |
| contents | This work proposes a simple training-free prompt-free approach to leverage large language models (LLMs) for the Chinese spelling correction (CSC) task, which is totally different from all previous CSC approaches. The key idea is to use an LLM as a pure language model in a conventional manner. The LLM goes through the input sentence from the beginning, and at each inference step, produces a distribution over its vocabulary for deciding the next token, given a partial sentence. To ensure that the output sentence remains faithful to the input sentence, we design a minimal distortion model that utilizes pronunciation or shape similarities between the original and replaced characters. Furthermore, we propose two useful reward strategies to address practical challenges specific to the CSC task. Experiments on five public datasets demonstrate that our approach significantly improves LLM performance, enabling them to compete with state-of-the-art domain-general CSC models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_04027 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Simple yet Effective Training-free Prompt-free Approach to Chinese Spelling Correction Based on Large Language Models Zhou, Houquan Li, Zhenghua Zhang, Bo Li, Chen Lai, Shaopeng Zhang, Ji Huang, Fei Zhang, Min Computation and Language This work proposes a simple training-free prompt-free approach to leverage large language models (LLMs) for the Chinese spelling correction (CSC) task, which is totally different from all previous CSC approaches. The key idea is to use an LLM as a pure language model in a conventional manner. The LLM goes through the input sentence from the beginning, and at each inference step, produces a distribution over its vocabulary for deciding the next token, given a partial sentence. To ensure that the output sentence remains faithful to the input sentence, we design a minimal distortion model that utilizes pronunciation or shape similarities between the original and replaced characters. Furthermore, we propose two useful reward strategies to address practical challenges specific to the CSC task. Experiments on five public datasets demonstrate that our approach significantly improves LLM performance, enabling them to compete with state-of-the-art domain-general CSC models. |
| title | A Simple yet Effective Training-free Prompt-free Approach to Chinese Spelling Correction Based on Large Language Models |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2410.04027 |