Machine Translation of Low-Resource Indo-European Languages

Wei-Rui Chen          Muhammad Abdul-Mageed
Natural Language Processing Lab
The University of British Columbia
{weirui.chen,muhammad.mageed}@ubc.ca


Abstract

In this work, we investigate methods for the challenging task of translating between low-resource language pairs that exhibit some level of similarity. In particular, we consider the utility of transfer learning for translating between several Indo-European low-resource languages from the Germanic and Romance language families. In particular, we build two main classes of transfer-based systems to study how relatedness can benefit the translation performance. The primary system fine-tunes a model pre-trained on a related language pair and the contrastive system fine-tunes one pre-trained on an unrelated language pair. Our experiments show that although relatedness is not necessary for transfer learning to work, it does benefit model performance.

1 Introduction↩︎

Machine translation (MT) is currently one of the hot application areas of deep learning, with neural machine translation (NMT) achieving outstanding performance where large amounts of parallel data are available [1][4]. In low-resource settings, transfer learning methods have proven useful for improving system performance [4][6]. In this work, we focus on studying NMT, including in the low-resource scenario. In particular, we focus our attention on investigating the effect of language relatedness on the transfer process. We define relatedness of a pair of languages based on belonging to the same language family. That is, by ‘related’ we mean ‘within the same language family’ whereas by ‘unrelated’ we mean ‘belong to two different language families’. For example, we call English and Swedish related since they belong to the Germanic language family but English and French not related since the latter belongs to the Romance language family. As an analogy to human learning, we would like to ask: if there are two translators (pre-trained models), for example one Catalan \(\rightarrow\) Spanish translator and one Catalan \(\rightarrow\) English translator, will they (after extra training, i.e., fine-tuning/transfer learning process) have different abilities to translate from Catalan into Occitan? If the Catalan-Spanish translator proves to perform better Catalan \(\rightarrow\) Occitan, we may attribute this to Spanish and Occitan being members of the Romance language family while English being a member of the, Germanic, different family.

Of particular interest to us are two sets of languages belonging to two different language families, one set to Romance and the other set to Germanic. For the former set, we take Catalan (ca), Italian (it), Occitan (oc), Romanian (ro), and Spanish (es); and we take English (en) for the latter set. We note that both Romance and Germanic are two branches of the larger Indo-European language family, and hence there are some level of relatedness between all the languages we study in this work. Nevertheless, languages in Romance and Germanic differ in some syntactic structures. For example, the position of attributive adjectives in Germanic languages is before the noun while it is after the noun for Romance languages [7]. Despite differences, the writing system of all languages in this work is the Latin script. This can be beneficial to transfer learning because these languages can potentially share common lexical items or morphemes, which may facilitate the transfer learning process.

Table 1: Pre-trained model choices for our primary and contrastive NMT systems.
Lang. Pair Primary Contrastive
ca-it ca-it/ca-es ca-en
ca-oc ca-es ca-en
ca-ro ca-es ca-en

As mentioned, we adopt transfer learning since it has been shown to improve translation quality for low-resource language pairs. For example, [5] sequentially build a parent model and a child model where each is trained, respectively, on high-resource and low-resource language pairs with the child model retaining parameters from the parent model. In addition, [4] successfully transfer knowledge from a parent model to a child model where both models are trained on low-resource but related language pairs. [6] also adopt a similar approach to these previous works, but based their work on the Transformer architecture [8] instead of using a recurrent encoder-decoder network with attention  [9], [10].

Our work builds on these studies. Namely, we empirically apply transfer learning under different conditions to members of various language families. The outcomes of our work are similar to those of [5], [6]. That is, while we find relatedness to be beneficial, a positive transfer between an unrelated language pair can still be possible (although with a potentially diminished performance).

The rest of this paper is organized as follows: In Section 2, we overview related work. We introduce our datasets and experiments in Section 3. In Section 4, we present and analyze our results. We conclude in Section 5.

2 Background↩︎

2.1 Transfer learning↩︎

Transfer learning is a machine learning approach that aims at transferring the knowledge of one task to another. As an analogy to human learning, one who masters the skills to ride a bicycle may transfer the knowledge to riding a motorcycle because these two tasks share common abilities such as maintaining balance on a two-wheel moving vehicle [11], [12]. We employ transfer learning to port knowledge from a model trained on one pair of languages to another. We now discuss transfer learning in NMT.

2.2 Transfer learning in Machine Translation↩︎

 [5] design a framework where a parent model is trained on a high-resource language pair while retaining model parameters for the child model to start fine-tuning with. Using this method, [5] improve system performance by an average of \(5.6\) BLEU points. The improvement is realized by transferring what is learnt in the high-resource language pair to the low-resource language pair. The Uzbek-English model obtains \(10.7\) BLEU score without the parent model and improves to \(15.0\) with the French-English parent model. The Spanish-English model has \(16.4\) BLEU score without the parent model and \(31.0\) with the French-English parent model. These results show that applying transfer learning contributes \(4.3\) and \(14.6\) BLEU points gain. Based on results from  [5], the closer the two source languages, the more performance gain acquired. Due to the relatedness between Spanish and French (both are members of the Roman language family), performance gain is higher for this pair.

Following previous work, [4] design a paradigm similar to that of [5] but maintain one major difference. In particular, [4] try to make use of relatedness between the parent and child models at the vocabulary level: instead of randomly mapping tokens in the parent and child vocabulary, they retain the parent tokens for the child model if these tokens exist in child language pair. This approach is based on two assumptions - (i) the lexicons of the parent and child language pair have at least some partial overlap and (ii) these identical tokens have similar meaning. Instead of the word-level tokenization in [5],  [4] use Byte Pair Encoding (BPE) [13], [14] to obtain subword tokens which may increase the number of overlapped tokens between the parent and child models. Improvement of \(0.8\) and \(4.3\) in BLEU score were obtained for the Turkish-English and Uyghur-English child models as transferred from an Uzbek-English parent model.

Following the previous two works,  [6] take a similar approach but use the Transformer architecture. They obtain an improvement of \(3.38\) BLEU for an English-Estonian child model transferred from an English-Czech parent model. Similarly, [15] add a second language related to the added low-resource language to avoid overfitting when fine-tuning. This mechanism has shown to be effective. Other works have investigated NMT approaches to similar languages by pre-training new language models on the low-resource languages [16] or without necessarily applying transfer learning [17][20], and there are several works on low resource languages [21]. We now introduce our experimental settings.

3 Experimental Settings↩︎

Table 2: Primary system results. We did not submit the ca-it language pair fine-tuned on the ca-es pre-trained model to the WMT2021 shared task, and hence the results are calculated by ourselves with Sacrebleu.
Baseline Our models
Pre-trained Model Lang. Pairs BLEU chrF BLEU chrF TER COMET BertScore
ca-it ca-it 29.31 0.583 35.06 0.622 0.477 0.391 0.886
ca-es ca-it 7.07 0.370 33.13 0.602 0.499 - -
ca-es ca-oc 12.56 0.472 59.93 0.787 0.254 0.538 0.928
ca-es ca-ro 4.43 0.266 11.24 0.354 0.855 -0.908 0.749
Table 3: Contrastive system reuslts
Baseline Our models
Pre-trained Model Lang. Pairs BLEU chrF BLEU chrF TER COMET BertScore
ca-en ca-it 1.97 0.249 25.46 0.539 0.574 -0.263 0.844
ca-en ca-oc 2.16 0.258 51.46 0.736 0.316 0.259 0.905
ca-en ca-ro 1.59 0.209 8.61 0.311 0.884 -1.119 0.725

3.1 Languages & Settings↩︎

We carry out experiments on three language pairs: ca-it, ca-oc, and ca-ro. The number of parallel sentences of each dataset is shown in Table 4. Training data are from OPUS [22], particularly version 1 of the WikiMatrix datasets [23]. They are data of child language pair and are used to fine-tune pre-trained model. Development and test data are provided by organizers of the Multilingual Low-Resource Translation for Indo-European Languages shared task. The shared task is hosted in EMNLP 2021 Sixth Conference on Machine Translation (WMT21).

Table 4: Distribution of dataset
Lang. Pairs Train Dev Test
ca-it 1,143,531 1269 1743
ca-oc 138,743 1269 1743
ca-ro 490,064 1269 1743

We build two systems: a Primary system and a Contrastive system. The primary system fine-tunes pre-trained ca-es and ca-it models, while the contrastive system fine-tunes a pre-trained ca-en model as shown in Table 1. The primary and contrastive systems serve as context for studying the role of language relatedness in transfer learning in NMT. We submitted predictions of the two systems to the WMT2021 shared task, and evaluation was based on blind test sets with a number of metrics as run by shared task organizers. An exception is the ca-it language pair fine-tuned on top of the ca-es pre-trained model–we train the model of this pair post shared task formal evaluation.

3.2 Model Architecture↩︎

We leverage publicly accessible pre-trained models on Huggingface [24] from Helsinki-NLP [25]. The pre-trained MT models released by Helsinki-NLP are trained on OPUS. These models are Transformer-based implemented in the Marian-NMT framework [26]. Each model has six self-attention layers in both the encoder and decoder sides, and each layer has eight attention heads. The tokenization method is SentencePiece [27] which produces vocabulary of size \(49,621\), \(21,528\) and \(55,255\) for ca-es, ca-it, and ca-en models, respectively.

3.3 Approach↩︎

The pre-trained models are chosen based on the degree of relatedness of the original target language on which the model is trained and the new target language on which the model is fine-tuned. Primary system takes related languages while contrastive system takes unrelated languages. Since Catalan, Italian, Occitan, Romanian, and Spanish are all members of the Roman language family, we take ca-es as our pre-trained MT model for transfer learning. As English is a member of the Germanic language family, we use a ca-en pre-trained model for our transfer learning. Our model choices are summarized in Table 1.

Without modifying the architecture of the MT pre-trained models, all architecture-related hyperparameters are identical to the original edition. As for hyperparameters related to fine-tuning, the number of beams for beam search is modified from four for pre-training to six for fine-tuning. The batch size is set to be \(25\). Pre-trained models are further fine-tuned for \(30,000\) steps on OPUS bitext. The checkpoint with the lowest validation loss is then selected as our best model for prediction.

Similar to [4][6], to achieve transfer learning, we retain the parameters of the parent model when fine-tuning the child model. Besides, parent and child models share a common vocabulary. That is, we do not build distinct vocabularies for the parent model and child models. A shared vocabulary can contribute to better transfer learning since all our language pairs employ the same Latin writing system. We suspect a shared vocabulary is more influential when the two languages are related to each other since the languages may have common morphemes, lexical items, or syntactical structure. For unrelated languages, a shared vocabulary may not hurt since the token embeddings are not frozen throughout the fine-tuning process. That is, token embeddings can still be updated to attain better representations during training.

3.4 Baseline Models↩︎

To demonstrate the effectiveness of our transfer learning approach, we provide a baseline model for each language pair that is simply a parent model (a pre-trained model) without any fine-tuning on data of the child language pair.

3.5 Evaluation↩︎

The adopted metrics are BLEU [28], chrF [29], TER [30], COMET [31], and BERTScore [32]. BLEU, chrF and TER are measured with the implementation of Sacrebleu [33]1.

4 Results and Analysis↩︎

4.1 Primary and Contrastive Systems↩︎

As can be seen in the rightmost five columns in Table 2 and Table 3, primary system outperforms contrastive system across all metrics. We believe that ca-es pre-trained MT model performs better transfer learning because Spanish is closer to Italian, Occitan, and Romanian than English is to these languages. These results, as such, indicate that transfer learning between related language pairs can produce better performance than between unrelated language pairs.

4.2 Baseline and Fine-tuned Models↩︎

Our results in Table 2 and Table 3 show the effectiveness of transfer learning for both related and unrelated language pairs. This is the case since both systems experience a performance gain after fine-tuning.

As an interesting observation, it seems counter-intuitive to have the unrelated language pairs experience slightly higher performance gain. For example, regarding ca-oc language pair, the transfer learning provides \(47.37\) BLEU score improvement transferring from ca-es parent model but \(49.3\) BLEU score improvement transferring from ca-en parent model. We suspect this is because in our work, when fine-tuning, we fix source language and alter the target language.

Unlike multilingual MT models which requires target language label to be prepended at the beginning of a source sentence [34] or notifying the model what target language is for this forward propagation [35], the pre-trained models we use in this work are bilingual models which lack a mechanism to provide the model any information about current target language. Therefore, the ca-en pre-trained model does not know it should now be translating Catalan to Occitan instead of English. Due to producing prediction in an incorrect target language, the metrics will be very poor. After fine-tuning the parent models on data of the child language pairs, the models are likely abler to produce prediction in the correct target language. Due to baseline metrics being too low, the difference in metric values between non-fine-tuned (baseline) and fine-tuned models are large and that is why the performance gain can be higher in contrastive system than in primary system.

5 Conclusion↩︎

In this work, we confirm previous works showing that transfer learning benefits NMT. Besides, an empirical comparison between transferring from related and unrelated languages shows that relatedness is not strictly required for knowledge transfer, but it does result in higher performance than transferring with unrelated languages.

Acknowledgements↩︎

We appreciate the support from the Natural Sciences and Engineering Research Council of Canada, the Social Sciences and Humanities Research Council of Canada, Canadian Foundation for Innovation, Compute Canada (www.computecanada.ca), and UBC ARC–Sockeye (https://doi.org/10.14288/SOCKEYE).

References↩︎

[1]
P. Koehn and booktitle =. "Proceedings. of the F. W. on N. M. T. Knowles Rebecca", “Six challenges for neural machine translation,” 2017", address = "Vancouver, pp. 28–39, doi: 10.18653/v1/W17-3204.
[2]
S. Ranathunga, E.-S. A. Lee, M. P. Skenduli, R. Shekhar, M. Alam, and R. Kaur, “Neural machine translation for low-resource languages: A survey.” 2021 , eprint={2106.15115}, archivePrefix={arXiv}, primaryClass={cs.CL}.
[3]
M.-T. Luong, H. Pham, and booktitle=Proceedings. of the 2015. C. on E. M. in N. L. P. Manning Christopher D, “Effective approaches to attention-based neural machine translation,” 2015, pp. 1412–1421.
[4]
T. Q. Nguyen and D. Chiang, “Transfer learning across low-resource, related languages for neural machine translation,” CoRR, vol. abs/1708.09803, 2017, [Online]. Available: http://arxiv.org/abs/1708.09803 , archivePrefix = {arXiv}, eprint = {1708.09803}, timestamp = {Mon, 13 Aug 2018 16:47:44 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-09803.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}.
[5]
B. Zoph, D. Yuret, J. May, and booktitle =. "Proceedings. of the 2016. C. on E. M. in N. L. P. Knight Kevin", “Transfer learning for low-resource neural machine translation,” 2016", address = "Austin, Texas, pp. 1568–1575, doi: 10.18653/v1/D16-1163.
[6]
[7]
F. Van de Velde, P. Sleeman, and H. Perridon, “The adjective in germanic and romance,” Adjectives in Germanic and Romance, vol. 212, p. 1, 2014.
[8]
A. Vaswani et al., “Advances in neural information processing systems , editor = I. Guyon and U. V. Luxburg and S. Bengio and H. Wallach and R. Fergus and S. Vishwanathan and R. Garnett,” 2017, vol. 30, [Online]. Available: https://proceedings.neurips.cc/paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf.
[9]
D. Bahdanau, K. H. Cho, and booktitle=3rd. I. C. on L. R. I. 2015. Bengio Yoshua, “Neural machine translation by jointly learning to align and translate,” 2015.
[10]
T. Luong, H. Pham, and booktitle =. "Proceedings. of the 2015. C. on E. M. in N. L. P. Manning Christopher D.", “Effective approaches to attention-based neural machine translation,” 2015", address = "Lisbon, Portugal, pp. 1412–1421, doi: 10.18653/v1/D15-1166.
[11]
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on knowledge and data engineering, vol. 22, no. 10, pp. 1345–1359, 2009.
[12]
K. Weiss, T. M. Khoshgoftaar, and D. Wang, “A survey of transfer learning,” Journal of Big data, vol. 3, no. 1, pp. 1–40, 2016.
[13]
P. Gage, “A new algorithm for data compression,” C Users Journal, vol. 12, no. 2, pp. 23–38, 1994.
[14]
R. Sennrich, B. Haddow, and booktitle =. "Proceedings. of the 54th. A. M. of the A. for C. L. (. Birch Alexandra", “Neural machine translation of rare words with subword units,” 2016", address = "Berlin, Germany, vol. 1: Long Papers), pp. 1715–1725, doi: 10.18653/v1/P16-1162.
[15]
G. Neubig and booktitle =. "Proceedings. of the 2018. C. on E. M. in N. L. P. Hu Junjie", “Rapid adaptation of neural machine translation to new languages,” 2018", address = "Brussels, Belgium, pp. 875–880, doi: 10.18653/v1/D18-1103.
[16]
E. M. B. Nagoudi, W.-R. Chen, M. Abdul-Mageed, and booktitle=Proceedings. of the F. W. on N. L. P. for I. L. of the A. Cavusogl Hasan, “IndT5: A text-to-text transformer for 10 indigenous languages,” 2021, pp. 265–271.
[17]
M. Przystupa and booktitle=Proceedings. of the 4th. C. on M. (. Abdul-Mageed Muhammad, “Neural machine translation of low-resource and similar languages with backtranslation,” 2019, vol. 3: Shared Task Papers, Day 2), pp. 224–235, [Online]. Available: https://aclanthology.org/W19-5431.pdf.
[18]
I. Adebara, E. M. B. Nagoudi, and booktitle =. "Proceedings. of the F. C. on M. T. Abdul Mageed Muhammad", “Translating similar languages: Role of mutual intelligibility in multilingual transformers,” 2020", address = "Online, pp. 381–386, [Online]. Available: https://aclanthology.org/2020.wmt-1.42.pdf.
[19]
L. Barrault et al., “Findings of the 2019 conference on machine translation (wmt19),” 2019, vol. 2: Shared Task Papers, Day 1), pp. 1–61, [Online]. Available: https://aclanthology.org/W19-5301.pdf.
[20]
L. Barrault et al., “Findings of the 2020 conference on machine translation (WMT20).”
[21]
I. Adebara, M. Abdul-Mageed, and M. Silfverberg, “Translating the unseen? Yoruba-english MT in low-resource, morphologically-unmarked settings,” arXiv preprint arXiv:2103.04225, 2021, [Online]. Available: https://arxiv.org/pdf/2103.04225.pdf.
[22]
booktitle =. "Proceedings. of the E. I. C. on L. R. Tiedemann Jörg and E. (LREC’12), “Parallel data, tools and interfaces in OPUS,” 2012", address = "Istanbul, Turkey, pp. 2214–2218, [Online]. Available: http://www.lrec-conf.org/proceedings/lrec2012/pdf/463_Paper.pdf.
[23]
H. Schwenk, V. Chaudhary, S. Sun, H. Gong, and booktitle =. "Proceedings. of the 16th. C. of the E. C. of the A. for C. L. M. V. Guzmán Francisco", “W ikiMatrix: Mining 135M parallel sentences in 1620 language pairs from Wikipedia,” 2021", address = "Online, pp. 1351–1361, [Online]. Available: https://aclanthology.org/2021.eacl-main.115.
[24]
T. Wolf et al., “Transformers: State-of-the-art natural language processing,” 2020", address = "Online, pp. 38–45, [Online]. Available: https://www.aclweb.org/anthology/2020.emnlp-demos.6.
[25]
J. Tiedemann and S. Thottingal, “OPUS-MT ? Building open translation services for the World , booktitle = Proceedings of the 22nd Annual Conferenec of the European Association for Machine Translation (EAMT),” 2020 , address = {Lisbon, Portugal}.
[26]
M. Junczys-Dowmunt et al., “M arian: Fast neural machine translation in C++,” 2018", address = "Melbourne, Australia, pp. 116–121, doi: 10.18653/v1/P18-4020.
[27]
T. Kudo and booktitle =. "Proceedings. of the 2018. C. on E. M. in N. L. P. S. D. Richardson John", “S entencePiece: A simple and language independent subword tokenizer and detokenizer for neural text processing,” 2018", address = "Brussels, Belgium, pp. 66–71, doi: 10.18653/v1/D18-2012.
[28]
K. Papineni, S. Roukos, T. Ward, and booktitle =. "Proceedings. of the 40th. A. M. of the A. for C. L. Zhu Wei-Jing", “B leu: A method for automatic evaluation of machine translation,” 2002", address = "Philadelphia, Pennsylvania, USA, pp. 311–318, doi: 10.3115/1073083.1073135.
[29]
booktitle =. "Proceedings. of the T. W. on S. M. T. Popović Maja", “ChrF: Character n-gram F-score for automatic MT evaluation,” 2015", address = "Lisbon, Portugal, pp. 392–395, doi: 10.18653/v1/W15-3049.
[30]
J. Olive, “Global autonomous language exploitation (GALE),” DARPA/IPTO Proposer Information Pamphlet, 2005.
[31]
R. Rei, C. Stewart, A. C. Farinha, and booktitle =. "Proceedings. of the 2020. C. on E. M. in N. L. P. (EMNLP). Lavie Alon", “COMET : A neural framework for MT evaluation,” 2020", address = "Online, pp. 2685–2702, [Online]. Available: https://www.aclweb.org/anthology/2020.emnlp-main.213.
[32]
T. Zhang, V. Kishore, F. Wu, K. Q. Weinberger, and booktitle=International. C. on L. R. Artzi Yoav, “BERTScore: Evaluating text generation with BERT,” 2019.
[33]
booktitle =. "Proceedings. of the T. C. on M. T. R. P. Post Matt", “A call for clarity in reporting BLEU scores,” 2018", address = "Brussels, Belgium, pp. 186–191, doi: 10.18653/v1/W18-6319.
[34]
M. Johnson et al., “G oogles multilingual neural machine translation system: Enabling zero-shot translation,” Transactions of the Association for Computational Linguistics, vol. 5, pp. 339–351, 2017, doi: 10.1162/tacl_a_00065.
[35]
Y. Liu et al., “Multilingual denoising pre-training for neural machine translation,” Transactions of the Association for Computational Linguistics, vol. 8, pp. 726–742, 2020, doi: 10.1162/tacl_a_00343.

  1. https://github.com/mjpost/sacrebleu↩︎