基于强化学习的古今汉语句子对齐研究
Summary
Neural machine translation between Classical (ancient) and Modern Chinese lacks large, high-quality sentence-aligned parallel data. Older alignment methods score sentence pairs with length, lexical, and shared-character features. They capture meaning poorly and struggle with many-to-many alignments. The authors frame alignment within already-matched paragraph pairs as an unsupervised sequential decision problem.
A BERT model works as a binary matcher, using a next-sentence-prediction-style input of the form [CLS] ancient [SEP] modern. It is first warmed up on rough sentence pairs that the LCS algorithm extracts, with randomly sampled negatives added. It is then trained as a policy network inside a dynamic-programming search over 1-1, 1-2, 2-1 and 2-2 candidate merges. The training signal is a reward for covering as many sentence pairs as possible, optimized with policy gradient plus a baseline. Matches involving more than one sentence earn larger rewards, which pushes the model to notice non-1-1 patterns.
On a manually aligned test set from the Twenty-Four Histories, the approach beats the strongest earlier baseline. The biggest gains are on many-to-many alignments. This provides a way to mine parallel data for low-resource historical translation.
Key points
- Data: About 300 articles from 《二十四史》 (Twenty-Four Histories) were crawled with their modern translations, giving roughly 9,000 hand-aligned paragraph pairs.
- 200 of these paragraphs were sentence-aligned by hand, yielding 1,550 test sentence pairs labeled by alignment pattern.
- The remaining paragraphs serve as training data.
- Alignment patterns: Earlier statistics show 1-1 alignments make up about 90.12% of the data, and patterns up to 2-2 cover about 98.98%. The model therefore handles only patterns up to 2-2, and folds 1-0/0-1 cases into 1-2/2-1.
- Rewards and complexity: A rejected match earns 0 reward, an accepted 1-1 match earns 2, and accepted 1-2, 2-1 and 2-2 matches earn 3 each. The DP runs in O(MN) time, so the method suits paragraph-aligned corpora rather than whole-document ones.
- Claimed contributions:
- first use of a pre-trained language model for ancient–modern Chinese sentence alignment;
- a global RL objective that maximizes alignment coverage;
- a newly built alignment corpus.
- Publication: The PDF header shows the paper appeared in 中文信息学报 vol. 38, no. 12 (Dec 2024), pp. 30–38. It comes from Beijing Language and Culture University.
Cite
@article{2025,
title = {{基于强化学习的古今汉语句子对齐研究}},
author = {喻快 and 邵艳秋 and 李炜},
journal = {中文信息学报 (Journal of Chinese Information Processing)},
year = {2025},
url = {http://jcip.cipsc.org.cn/article/id/zwxxxb_3831}
}References
- Pr o c e ed i ngso ft he55 t hAnnua lMe e t i ngo ft heAs s o - c i a t i onf o rCompu t a t i ona lL i ngu i s t i c s, 2017:562 - 570. find
- [ 21] DEVLINJ, CHANG M W, LEE K, e ta l.Be r t:Pr e - t r a i n i ng o fde ep b i d i r e c t i ona lt r ans f o rme r sf o rl a n - //Pr a eund e r s t a nd i ng[ C] o c e e d i ng so ft h e NAACL, gu g 2014:4171 - 4186. find
- [ ] , 22 SUN Y WANGS, LIY, e ta l.Er n i e:Enhanc edr ep - r e s en t a t i ont hr ough knowl edgei n t eg r a t i on[ J]. a rXi v r ep r i n ta rXi v: 1904. 09223, 2019. p [ 23] LIS, ZHAOZ,HU R, e ta l.Ana l og i c a lr e a s on i ngon // Ch i ne s e mo r l og i c a lands eman t i cr e l a t i ons[… find
- [ 24] KINGMA DP, BAJ.Adam:A me t hodf o rs t o cha s t i c [ ] / / op t imi z a t i on C Pr o c e ed i ngso ft he3r dI n t e r na t i on - a lCon f e r enc ef o rLe a r n i ngRep r e s en t a t i ons,2015. find
- 谢文秀( 1993—), 博 士 研 究 生, 主 要 研 究 领 域 为 问答、 机 器 学 习、 自 然 语 言 处 理、 健 康 信 息 学、 公 find
This page in Markdown → https://md.research.elamur.ai/free/papers/yu-2025-sentence-alignment-ancient/