Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Overcoming the Rare Word Problem for Low-Resource Language Pairs in Neural Machine Translation (1910.03467v2)

Published 7 Oct 2019 in cs.CL, cs.LG, and stat.ML

Abstract: Among the six challenges of neural machine translation (NMT) coined by (Koehn and Knowles, 2017), rare-word problem is considered the most severe one, especially in translation of low-resource languages. In this paper, we propose three solutions to address the rare words in neural machine translation systems. First, we enhance source context to predict the target words by connecting directly the source embeddings to the output of the attention component in NMT. Second, we propose an algorithm to learn morphology of unknown words for English in supervised way in order to minimize the adverse effect of rare-word problem. Finally, we exploit synonymous relation from the WordNet to overcome out-of-vocabulary (OOV) problem of NMT. We evaluate our approaches on two low-resource language pairs: English-Vietnamese and Japanese-Vietnamese. In our experiments, we have achieved significant improvements of up to roughly +1.0 BLEU points in both language pairs.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Thi-Vinh Ngo (4 papers)
  2. Thanh-Le Ha (13 papers)
  3. Phuong-Thai Nguyen (4 papers)
  4. Le-Minh Nguyen (23 papers)
Citations (11)