<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On the Development of Customized Neural Machine Translation Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mauro Cettolo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roldano Cattoni</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Turchi Fondazione Bruno Kessler</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Trento</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>cettolo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>cattoni</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>turchi}@fbk.eu</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Recent advances in neural modeling boosted performance of many machine learning applications. Training neural networks requires large amounts of clean data, which are rarely available; many methods have been designed and investigated by researchers to tackle this issue. As a partner of a project, we were asked to build translation engines for the weather forecast domain, relying on few, noisy data. Step by step, we developed neural translation models, which outperform by far Google Translate. This paper details our approach, that - we think - is paradigmatic for a broader category of applications of machine learning, and as such could be of widespread utility.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>The field of machine translation (MT) has
experienced significant advances in recent years thanks
to improvements in neural modeling. On the one
hand, this represents a great opportunity for
industrial MT, on the other it also poses the great
challenge of collecting large amounts of clean data,
needed to train neural networks. MT training data
are parallel corpora, that is collections of sentence
pairs where a sentence in the source language is
paired with the corresponding translation in the
target language. Parallel corpora are typically
gathered from any available source, in most cases
the web, without much guarantees about quality
nor domain homogeneity.</p>
      <p>Over the years, the scientific community has
accumulated a lot of knowledge on ways to
ad</p>
      <p>
        Copyright © 2021 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).
dress the problem of the quantitative and
qualitative inadequacy of parallel data necessary to
develop translation models. Among others, deeply
investigated methods are: corpus filtering
        <xref ref-type="bibr" rid="ref6">(Koehn
et al., 2020)</xref>
        , data augmentation such as data
selection
        <xref ref-type="bibr" rid="ref1 ref9">(Moore and Lewis, 2010; Axelrod et
al., 2011)</xref>
        and back-translation
        <xref ref-type="bibr" rid="ref14 ref3">(Bertoldi and
Federico, 2009; Sennrich et al., 2016)</xref>
        , model
adaptation
        <xref ref-type="bibr" rid="ref4 ref7">(Luong and Manning, 2015; Chu and Wang,
2018)</xref>
        . They should be the working tools of
anyone who has to develop neural MT models for
specific language pairs and domains.
      </p>
      <p>This paper reports on the development of neural
MT models for translating forecast bulletins from
German into English and Italian, and from
Italian into English and German. We were provided
with in-domain parallel corpora for each language
pair but not in sufficient quantity to train a neural
model from scratch. Moreover, from the
preliminary analysis of data, the English side resulted
noisy (e.g. missing or partial translations,
misaligned sentences, etc.), affecting the quality of
any pair involving that language. For this very
reason, we focus on one of the pairs involving English
we had to cover, namely Italian-English.</p>
      <p>An overview of the in-domain data and the
description of their analysis are given in Section 2,
highlighting the issues that emerged. Section 3
describes the previously listed methods together with
their employment in our specific use-case.
Developed neural translation models are itemized in
Section 4, where their performance are compared
and discussed; our best models outperform by far
Google Translate and some examples will give a
grasp of the actual translation quality.</p>
      <p>We think that our approach to the specific
problem we had to face is paradigmatic for a broader
category of machine learning applications, and we
hope that it will be useful to the whole NLP
scientific community.</p>
    </sec>
    <sec id="sec-2">
      <title>Data</title>
      <p>We were provided with two csv files of weather
forecast bulletins, issued by two different forecast
services that from here on are identified with the
acronyms BB and TT. Each row of the BB csv
contains, among other things, the text of the original
bulletin written in German and, possibly, its
translation into Italian and/or English; in the TT csv
rows, the Italian bulletin is paired with its
translation into German and/or English.
2.1</p>
      <sec id="sec-2-1">
        <title>Statistics</title>
        <p>
          BB Bulletins were extracted from the BB csv file
and paired for any possible combination of
languages. Each bulletin is stored on a single line
but split in a few dozen fields; the average length
of each field (about 18 German words) is
appropriate for MT systems, which process long
sentences with difficulty. Table 1 shows statistics of
the training and test sets for the it-en language pair.
site task set #seg #src w #trg w
trn-nsy 30,957 626,211 505,688
BB it-en tst-nsy 20,000 376,553 298,560
tot 50,957 1,002,764 804,248
TT Bulletins were extracted from the TT csv file
and paired for each language combination.
Differently than the BB case, each TT bulletin was
stored on a single line without any field split;
since bulletins are quite long for automatic
processing (on average 30 Italian words) and are
the concatenation of rather heterogeneous
sentences, we decided to segment them by splitting on
strong punctuation. This requires a re-alignment
of source/target segments because in general they
differ in number. The re-alignment was performed
by means of the hunalign sentence aligner1
          <xref ref-type="bibr" rid="ref17">(Varga
et al., 2005)</xref>
          . Table 2 shows statistics of the
training and test sets for the it-en language pair.
site task
TT
set #seg #src w #trg w
trn 5,177 78,834 73,763
it-en tst 1,962 30,232 28,135
        </p>
        <p>tot 7,139 109,066 101,898
1github.com/danielvarga/hunalign
As a good practice before starting the creation of
MT models, data have been inspected and
analyzed looking for potential problems. Several
critical issues emerged, which are described in the
following paragraphs.</p>
        <p>Non-homogeneity of data - Since data originated
from two distinct weather forecast services (BB
and TT), first of all it must be established whether
they are linguistically similar and, if so, to what
extent. For this purpose, focusing on the
languages of the it-en benchmarks, we measured the
perplexity of the BB and TT test sets on n-gram
language models (LMs) estimated on the BB and
TT training sets:2 the closer the perplexity values
of a given text on the two LMs, the greater the
linguistic similarity of BB and TT training sets.
Table 3 reports values of perplexity (PP) and
out-ofvocabulary rates (%OOV) for all test sets vs. LMs
combinations.3
it
en</p>
        <p>PP
BB tst 10.8
TT tst 42.4
BB tst 8.9
TT tst 65.6</p>
        <sec id="sec-2-1-1">
          <title>LM trained on</title>
          <p>BB trn TT trn
%OOV PP %OOV
0.22 92.0 12.07
0.60 10.3 0.41
0.14 80.1 8.49
2.05 12.7 0.51</p>
          <p>Overall, we can notice that the PP of the two test
sets significantly varies when computed on in- and
out-of-domain data. The PP of any given test set is
4 (42.4 vs. 10.8) to 9 (92.0 vs. 10.3) times higher
when measured on the LM estimated on the text
of the other provider than on the text of the same
provider. These results highlight the remarkable
linguistic difference between the bulletins issued
by the two forecast services.</p>
          <p>In-domain data scarcity - Current
state-of-theart MT neural networks (Section 4.1) have dozens
to hundreds million parameters that have to be
estimated from data. Unfortunately, the amount of
provided data does not allow an effective
estimation from scratch of such a huge number of
parameters, as we will empirically prove in Section 4.3.</p>
          <p>
            23-gram LMs with modified shift beta smoothing were
estimated using the IRSTLM toolkit
            <xref ref-type="bibr" rid="ref5">(Federico et al., 2008)</xref>
            .
          </p>
          <p>3In order to isolate the genuine PP of the text, the
dictionary upperbound to compute OOV word penalty was set to 0;
the OOV rates are shown for this very reason.</p>
          <p>BB English side - BB data have a major problem
on the English side. In fact, looking at csv file,
we realized that many German bulletins were not
translated at all into English. Moreover, in the
English side there are 20% fewer words than in the
corresponding German or Italian sides, a
difference that is not justified by the morpho-syntactic
variations between languages. In fact, it happens
that entire portions of the original German
bulletins are not translated into English, or that a
definitely more compact form is used, as in:
de: Der Hochdruckeinfluss h a¨lt bis auf weiteres an.
en: High pressure conditions.</p>
          <p>This critical issue affects both training and test
sets, as highlighted by figures in Table 1; as such,
it negatively impacts both the quality of the
translation models, if trained/adapted on such noisy
data, and the reliability of evaluations, if run on
such distorted data. A careful corpus filtering is
therefore needed, as discussed in Section 3.2.
3
3.1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Methods</title>
      <sec id="sec-3-1">
        <title>MT Model Adaptation</title>
        <p>
          A standard method for facing the in-domain data
scarcity issue mentioned in Section 2.2 is the
so-called fine-tuning : given a neural MT model
trained on a large amount of data in one domain,
its parameters are tuned by continuing the
training using a small amount of data from another
domain
          <xref ref-type="bibr" rid="ref4 ref7">(Luong and Manning, 2015; Chu and Wang,
2018)</xref>
          . Though effective on the new in-domain
data supplied for model adaptation, fine-tuning
typically suffers from performance drops on
unseen data (test set), unless proper regularization
techniques are adopted
          <xref ref-type="bibr" rid="ref8">(Miceli Barone et al.,
2017)</xref>
          . We avoid overfitting by fine-tuning our MT
models with dropout (set to 0.3)
          <xref ref-type="bibr" rid="ref16">(Srivastava et al.,
2014)</xref>
          and performing only a limited number of
epochs (5)
          <xref ref-type="bibr" rid="ref8">(Miceli Barone et al., 2017)</xref>
          .
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Corpus Filtering</title>
        <p>
          Machine learning typically requires large sets of
clean data. Since rarely large data sets are also
clean, researchers devoted much effort to data
cleaning, the automatic process to identify and
remove errors from data. The MT community is no
exception. Even, WMT - the conference on
machine translation - in 2018, 2019 and 2020
editions organized a Shared Task on Parallel Corpus
Filtering. Koehn et al. (2020) provide details on
the task proposed in the more recent edition, on
participants, their methods and results. For
reference purposes, organizers set up a competitive
baseline based on LASER (Language-Agnostic
SEntence Representations)4
          <xref ref-type="bibr" rid="ref13">(Schwenk and Douze,
2017)</xref>
          multilingual sentence embeddings. The
underlying idea is to use the cosine distance between
the embeddings of the source and the target
sentences to measure their parallelism. In a similar
way we cleaned the BB noisy benchmark, filtering
with a threshold of 0.9; statistics of the resulting
bi-text are given in Table 4.
        </p>
        <p>site task set</p>
        <p>trn-cln
BB it-en tst-cln
tot
#seg
1,673
1,011
2,684
#src w
37,629
20,280
57,909
#trg w
40,256
21,657
61,913</p>
        <p>The filtered bi-text does not suffer anymore
from the imbalance number of words but it is 20
times smaller than the original one.
Since the corpus filtering discussed in the previous
section removes most of the original data, further
exacerbating the problem of data scarcity, we tried
to overcome this unwanted side effect by means of
data augmentation methods.
A widespreadly adopted data augmentation
method is data selection. Data selection assumes
the availability of a large general domain corpus
and a small in-domain corpus; in MT, the aim is to
extract parallel sentences from the large bilingual
corpus that are most relevant to the target domain
as defined by the small corpus.</p>
        <p>
          On the basis of the bilingual cross-entropy
difference
          <xref ref-type="bibr" rid="ref1">(Axelrod et al., 2011)</xref>
          , we sorted the
sentence pairs of the OPUS collection,5 used as
general domain large dataset, according to their
relevance to the domain determined by the
concatenation of the BB and TT training sets. To
establish the optimal size of the selection, we trained
LMs - created in the same setup described in
nonhomogeneity of data paragraph of Section 2.2 - on
increasing amounts of selected data and computed
the PP of BB and TT test sets, separately for each
side. Figure 1 plots the curves; the straight lines on
4github.com/facebookresearch/LASER
5opus.nlpl.eu
the bottom correspond to the PP of the same test
sets on LMs built on the in-domain training sets.
        </p>
        <p>The form of curves is convex, as usual in data
selection. In our case, the best trade-off between
the pertinence of data and its amount occur when
something more than a million words is selected;
therefore, we decided to mine from OPUS the
bilingual text whose size is given in row DS of
Table 5. Anyway, note that the lowest PP for
selections is at least one order of magnitude greater
than on LMs trained on in-domain training sets.
task
it-en
set
DS
BT</p>
        <p>#seg #src w #trg w
206,990 1,352,623 1,312,068</p>
        <p>30,957 482,398 505,688</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3.2 Back Translation</title>
        <p>
          Another well-known data-augmentation method,
which somehow also represents an alternative
way to corpus filtering for dealing with the BB
English side issue, is back-translation.
Backtranslation
          <xref ref-type="bibr" rid="ref14 ref3">(Bertoldi and Federico, 2009; Sennrich
et al., 2016; Edunov et al., 2018)</xref>
          assumes the
availability of an MT system from the target
language to the source language and of target
monolingual data. The MT system is used to translate
the target monolingual data into the source
language. The result is a parallel corpus where the
source side is the synthetic MT output while the
target is human text. The synthetic parallel
corpus is then used to train or adapt a source-to-target
MT system. Although simple, this method has
been shown to be very effective. We used
backtranslation to generate a synthetic, but hopefully
cleaner, version of the BB training set. The
translation into Italian of the 31k English segments of
the training set (Table 1) was performed by an
in-house generic en-it MT engine (details in
Appendix A.1 of
          <xref ref-type="bibr" rid="ref2">(Bentivogli et al., 2021)</xref>
          ). Row
BT of Table 5 shows the statistics of this
artificial bilingual corpus; similarly to what happened
with the filtering process, the numbers of Italian
and English words are much more compatible than
they are in the original version of the corpus.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental Results</title>
      <sec id="sec-4-1">
        <title>MT Engine</title>
        <p>
          The MT engine is built on the ModernMT
framework6 which implements the
Transformer
          <xref ref-type="bibr" rid="ref18">(Vaswani et al., 2017)</xref>
          architecture. The
original generic model is Big sized, as defined
in
          <xref ref-type="bibr" rid="ref18">(Vaswani et al., 2017)</xref>
          by more than 200
million parameters. For training, bi-texts were
downloaded from the OPUS repository5 and
then filtered through the already mentioned data
selection method
          <xref ref-type="bibr" rid="ref1">(Axelrod et al., 2011)</xref>
          using a
general-domain seed. Statistics of the resulting
corpus are provided in Table 6. Training was
performed in the setup detailed in
          <xref ref-type="bibr" rid="ref2">(Bentivogli et
al., 2021)</xref>
          .
        </p>
        <p>The same Big model and its smaller variants,
the Base with 50 million parameters and the Tiny
with 20 million parameters, were also trained on
in-domain data only for the sake of comparison.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>MT Models</title>
        <p>
          We empirically compared the quality of
translations generated by various MT models: two
generic, three genuine in-domain of different size
and several variants of our generic model adapted
(Section 3.1) on in-domain data resulting from the
presented methods: filtering (Section 3.2), data
selection (Section 3.3.1) and back-translation
(Section 3.3.2). Performance was measured on the
BB and TT test sets in terms of BLEU
          <xref ref-type="bibr" rid="ref10">(Papineni et al., 2002)</xref>
          , TER
          <xref ref-type="bibr" rid="ref15">(Snover et al., 2006)</xref>
          and
CHRF
          <xref ref-type="bibr" rid="ref11">(Popovic´, 2015)</xref>
          scores computed by means
of SacreBLEU (v1.4.14)
          <xref ref-type="bibr" rid="ref12">(Post, 2018)</xref>
          , with default
6github.com/modernmt/modernmt
        </p>
        <sec id="sec-4-2-1">
          <title>MT model</title>
          <p>Scores are collected in Table 7. First, as
expected (in-domain data scarcity paragraph of
Section 2.2), it is not feasible to properly train a
huge number of parameters with few data; in
fact, the best performing pure in-domain model is
the smallest one (Transformer tiny). Instead, the
naive application of the MT state-of-the-art would
have led to simply train a Transformer big model
on the original in-domain data. This model would
not have been competitive with GT on TT data
(28.01 vs. 32.20 BLEU); it would have been on
BB data if we had only considered the noisy test
set (20.45 vs. 11.45) resulting in an important
misinterpretation of the actual quality of the two
systems; conversely, our preliminary analysis allowed
us to discover the need of cleaning BB data, which
guarantees a reliable assessment (24.73 vs. 32.59).</p>
          <p>Data augmentation methods (DS, BT) are both
effective in making available additional useful
bitexts; for example, the BLEU score of the model
BBtrn-cln+TTtrn increases by 3 absolute points
7BLEU+case.mixed+numrefs.1+smooth.exp+tok.13a,
TER+tok.tercom-nonorm-punct-noasian-uncased,
chrF2+numchars.6+space.false
(from 37.02 to 40.09) when DS and BT data are
added to the adaptation corpus.</p>
          <p>The fine-tuning of a Transformer big generic
model to the weather forecast domain turned out
to be more effective than any training from scratch
using original in-domain data only: the top
performing model - BBtrn-cln+TTtrn+DS+BT -
definitely improves the Transformer tiny with
respect to all metrics on the BB clean test set
(40.09/45.28/.6617 vs 35.80/61.05/.5808), and to
two metrics out of three on the TT test set (TER:
51.01 vs. 51.79, CHRF: .6803 vs. .6488).
Moreover, all its scores are a lot better than those of
Google Translate.
4.4</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>Examples</title>
        <p>To give a grasp of the actual quality of automatic
translations, Table 8 collects the English text
generated by some of the tested MT models fed with a
rather complex Italian source sentence. The
manual translations observed in BB data are shown as
well: their number, their variety, some
questionable/wrong lexical choices in them (“high” instead
of “upper-level currents”, “South-western” instead
of “Southwesterly”) and one totally wrong (“Weak
high pressure conditions.”) prove the difficulty of
learning from such data and the need to pay
par</p>
        <sec id="sec-4-3-1">
          <title>BBtrn-cln+TTtrn+DS+BT</title>
          <p>Italian source sentence:</p>
          <p>Le correnti in quota si disporranno da sudovest avvicinando masse d’aria piu` umida alle Alpi.
Manual English translations found in BB bulletins:</p>
          <p>Weak high pressure conditions.</p>
          <p>The high currents will turn to south-west and humid air mass will reach the Alps.
Southwesterly currents will bring humid air masses to South Tyrol.</p>
          <p>South-western currents will bring humid air masses to the Alps.</p>
          <p>South-westerly upper level flow will bring humid air masses towards our region.
More humid air masses will reach the Alps.</p>
          <p>Humid air reaches the Alps with South-westerly winds.</p>
          <p>Automatic English translations generated by some MT models:
GT The currents at high altitudes will arrange themselves from the southwest, bringing more
humid air masses closer to the Alps.</p>
          <p>FBK Currents in altitude will be deployed from the southwest, bringing wet air masses closer to
the Alps.</p>
          <p>Transformer tiny</p>
          <p>South-westerly upper level flow will bring humid air masses towards
the Alps.</p>
          <p>The upper level flow will be arranged from the southwest approaching
more humid air masses to the Alps.
ticular attention to the evaluation phase.
Concerning translations, GT is able to keep most of the
meaning of the source text but the translation is
too literal to result in fluent English. FBK only
partially transfers the meaning from the source
and generates a rather bad English text.
Transformer tiny provides a very good translation both
from a semantic and a syntactic point of view,
losing only the negligible detail that the “air masses”
are “more humid”, not simply “humid”. Finally,
BBtrn-cln+TTtrn+DS+BT, the model that on the
basis of our evaluations is the best one, on this
specific example works very well at the semantic level
but rather poorly on the grammatical level.</p>
          <p>This example shows that pure in-domain
models, as expected, are “more in-domain” than
generic models, though adapted, showing greater
adherence to domain-specific language. On the
other hand, according to scores in Table 7, adapted
models should be better in generalization. Only
subjective evaluations involving meteorologists
can settle the question of which model is the best.
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this paper we described the development
process that led us to build competitive customized
translation models. Given the provided in-domain
data, we started by analyzing them under
several perspectives and discovered that they are few,
noisy and heterogeneous. We faced these issues
by exploiting a number of methods which
represent established knowledge of the scientific
community: adaptation of neural models, corpus
filtering and data augmentation techniques such as
data selection and back-translation. In particular,
corpus filtering allowed us to avoid the misleading
results observed on the original noisy data, while
adaptation and data augmentation proved useful in
effectively taking advantage of out-of-domain
resources.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Amittai</given-names>
            <surname>Axelrod</surname>
          </string-name>
          , Xiaodong He, and
          <string-name>
            <given-names>Jianfeng</given-names>
            <surname>Gao</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Domain Adaptation via Pseudo In-Domain Data Selection</article-title>
          .
          <source>In Proc. of EMNLP</source>
          , pages
          <fpage>355</fpage>
          -
          <lpage>362</lpage>
          , Edinburgh, Scotland, UK.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Luisa</given-names>
            <surname>Bentivogli</surname>
          </string-name>
          , Mauro Cettolo, Marco Gaido, Alina Karakanta, Alberto Martinelli, Matteo Negri, and
          <string-name>
            <given-names>Marco</given-names>
            <surname>Turchi</surname>
          </string-name>
          .
          <year>2021</year>
          .
          <article-title>Cascade versus Direct Speech Translation: Do the Differences Still Make a Difference?</article-title>
          <source>In Proc. of ACL/IJCNLP</source>
          (Volume
          <volume>1</volume>
          : Long Papers), pages
          <fpage>2873</fpage>
          -
          <lpage>2887</lpage>
          , Bangkok, Thailand.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Nicola</given-names>
            <surname>Bertoldi</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marcello</given-names>
            <surname>Federico</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Domain Adaptation for Statistical Machine Translation with Monolingual Resources</article-title>
          .
          <source>In Proc. of WMT</source>
          , pages
          <fpage>182</fpage>
          -
          <lpage>189</lpage>
          , Athens, Greece.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Chenhui</given-names>
            <surname>Chu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Rui</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>A Survey of Domain Adaptation for Neural Machine Translation</article-title>
          . In Sergey Edunov, Myle Ott,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Auli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>David</given-names>
            <surname>Grangier</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Understanding Back-Translation at Scale</article-title>
          .
          <source>In Proc. of EMNLP</source>
          , pages
          <fpage>489</fpage>
          -
          <lpage>500</lpage>
          , Brussels, Belgium.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Marcello</given-names>
            <surname>Federico</surname>
          </string-name>
          , Nicola Bertoldi, and
          <string-name>
            <given-names>Mauro</given-names>
            <surname>Cettolo</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>IRSTLM: An Open Source Toolkit for Handling Large Scale Language Models</article-title>
          .
          <source>In Proc. of Interspeech</source>
          , pages
          <fpage>1618</fpage>
          -
          <lpage>1621</lpage>
          , Brisbane, Australia.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Philipp</given-names>
            <surname>Koehn</surname>
          </string-name>
          , Vishrav Chaudhary, Ahmed El-Kishky, Naman Goyal,
          <string-name>
            <surname>Peng-Jen Chen</surname>
          </string-name>
          , and Francisco Guzma´n.
          <year>2020</year>
          .
          <article-title>Findings of the WMT 2020 Shared Task on Parallel Corpus Filtering and Alignment</article-title>
          .
          <source>In Proc. of WMT</source>
          , pages
          <fpage>726</fpage>
          -
          <lpage>742</lpage>
          , Online.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Minh-Thang Luong</surname>
            and
            <given-names>Christopher D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Stanford Neural Machine Translation Systems for Spoken Language Domains</article-title>
          .
          <source>In Proc. of IWSLT</source>
          , pages
          <fpage>76</fpage>
          -
          <lpage>79</lpage>
          ,
          <string-name>
            <surname>Da</surname>
            <given-names>Nang</given-names>
          </string-name>
          , Vietnam.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Antonio</given-names>
            <surname>Valerio Miceli Barone</surname>
          </string-name>
          , Barry Haddow, Ulrich Germann, and
          <string-name>
            <given-names>Rico</given-names>
            <surname>Sennrich</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Regularization Techniques for Fine-tuning in Neural Machine Translation</article-title>
          .
          <source>In Proc. of EMNLP</source>
          , pages
          <fpage>1489</fpage>
          -
          <lpage>1494</lpage>
          , Copenhagen, Denmark.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Robert C.</given-names>
            <surname>Moore</surname>
          </string-name>
          and
          <string-name>
            <given-names>William</given-names>
            <surname>Lewis</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Intelligent Selection of Language Model Training Data</article-title>
          .
          <source>In Proc. of ACL (Short Papers)</source>
          , pages
          <fpage>220</fpage>
          -
          <lpage>224</lpage>
          , Uppsala, Sweden.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Kishore</given-names>
            <surname>Papineni</surname>
          </string-name>
          , Salim Roukos, Todd Ward, and
          <string-name>
            <given-names>WeiJing</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>BLEU: a Method for Automatic Evaluation of Machine Translation</article-title>
          .
          <source>In Proc. of ACL</source>
          , pages
          <fpage>311</fpage>
          -
          <lpage>318</lpage>
          , Philadelphia, US-PA.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Maja</surname>
            <given-names>Popovic´.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>chrF: character n-gram F-score for automatic MT evaluation</article-title>
          .
          <source>In Proc. of WMT</source>
          , pages
          <fpage>392</fpage>
          -
          <lpage>395</lpage>
          , Lisbon, Portugal.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Matt</given-names>
            <surname>Post</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>A Call for Clarity in Reporting BLEU Scores</article-title>
          .
          <source>In Proc. of WMT</source>
          , pages
          <fpage>186</fpage>
          -
          <lpage>191</lpage>
          , Belgium, Brussels.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Holger</given-names>
            <surname>Schwenk</surname>
          </string-name>
          and
          <string-name>
            <given-names>Matthijs</given-names>
            <surname>Douze</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Learning Joint Multilingual Sentence Representations with Neural Machine Translation</article-title>
          .
          <source>In Proc. of RepL4NLP</source>
          , pages
          <fpage>157</fpage>
          -
          <lpage>167</lpage>
          , Vancouver, Canada.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Rico</given-names>
            <surname>Sennrich</surname>
          </string-name>
          , Barry Haddow, and
          <string-name>
            <given-names>Alexandra</given-names>
            <surname>Birch</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Improving Neural Machine Translation Models with Monolingual Data</article-title>
          .
          <source>In Proc. of ACL (Volume 1: Long Papers)</source>
          , pages
          <fpage>86</fpage>
          -
          <lpage>96</lpage>
          , Berlin, Germany.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Matthew</given-names>
            <surname>Snover</surname>
          </string-name>
          , Bonnie Dorr, Rich Schwartz, Linnea Micciulla,
          <string-name>
            <given-names>and John</given-names>
            <surname>Makhoul</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>A Study of Translation Edit Rate with Targeted Human Annotation</article-title>
          .
          <source>In Proc. of AMTA</source>
          , pages
          <fpage>223</fpage>
          -
          <lpage>231</lpage>
          , Cambridge, US-MA.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Nitish</given-names>
            <surname>Srivastava</surname>
          </string-name>
          , Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <given-names>Ruslan</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dropout: A Simple Way to Prevent Neural Networks from Overfitting</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>15</volume>
          (
          <issue>56</issue>
          ):
          <fpage>1929</fpage>
          -
          <lpage>1958</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <article-title>Da´niel Varga, Pe´ter Hala´csy, Andra´s Kornai, Nagy Viktor</article-title>
          , Nagy Laszlo,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>La´szlo´, and</article-title>
          <string-name>
            <given-names>Tron</given-names>
            <surname>Viktor</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Parallel Corpora for Medium Density Languages</article-title>
          .
          <source>In Proc. of RANLP</source>
          , pages
          <fpage>590</fpage>
          -
          <lpage>596</lpage>
          , Borovets, Bulgaria.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Ashish</given-names>
            <surname>Vaswani</surname>
          </string-name>
          , Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones,
          <string-name>
            <given-names>Aidan N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Lukasz Kaiser, and
          <string-name>
            <given-names>Illia</given-names>
            <surname>Polosukhin</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Attention is All You Need</article-title>
          .
          <source>In Proc. of NIPS</source>
          , pages
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          , Long Beach, US-CA.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>