One Model to Learn Both: Zero Pronoun Prediction and Translation
Longyue Wang, Zhaopeng Tu, Xing Wang, Shuming Shi

TL;DR
This paper introduces a unified neural machine translation model that jointly predicts and translates zero pronouns in pro-drop languages, leveraging discourse context to improve translation accuracy and ZP prediction.
Contribution
It presents a novel end-to-end, discourse-aware approach for joint zero pronoun prediction and translation, outperforming previous methods that rely on external ZP prediction models.
Findings
Significant improvements in translation quality for Chinese-English and Japanese-English.
Enhanced ZP prediction accuracy through discourse-level context.
Error reduction, especially for subjective zero pronouns.
Abstract
Zero pronouns (ZPs) are frequently omitted in pro-drop languages, but should be recalled in non-pro-drop languages. This discourse phenomenon poses a significant challenge for machine translation (MT) when translating texts from pro-drop to non-pro-drop languages. In this paper, we propose a unified and discourse-aware ZP translation approach for neural MT models. Specifically, we jointly learn to predict and translate ZPs in an end-to-end manner, allowing both components to interact with each other. In addition, we employ hierarchical neural networks to exploit discourse-level context, which is beneficial for ZP prediction and thus translation. Experimental results on both Chinese-English and Japanese-English data show that our approach significantly and accumulatively improves both translation performance and ZP prediction accuracy over not only baseline but also previous works using…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Text Readability and Simplification
