Multi-Way, Multilingual Neural Machine Translation with a Shared Attention Mechanism

01/06/2016 ∙ by Orhan Firat, et al. ∙ Middle East Technical University 0

We propose multi-way, multilingual neural machine translation. The proposed approach enables a single neural translation model to translate between multiple languages, with a number of parameters that grows only linearly with the number of languages. This is made possible by having a single attention mechanism that is shared across all language pairs. We train the proposed multi-way, multilingual model on ten language pairs from WMT'15 simultaneously and observe clear performance improvements over models trained on only one language pair. In particular, we observe that the proposed model significantly improves the translation quality of low-resource language pairs.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Neural Machine Translation

It has been shown that a deep (recurrent) neural network can successfully learn a complex mapping between variable-length input and output sequences on its own. Some of the earlier successes in this task have, for instance, been handwriting recognition 

[Bottou et al.1997, Graves et al.2009] and speech recognition [Graves et al.2006, Chorowski et al.2015]. More recently, a general framework of encoder-decoder networks has been found to be effective at learning this kind of sequence-to-sequence mapping by using two recurrent neural networks [Cho et al.2014b, Sutskever et al.2014].

A basic encoder-decoder network consists of two recurrent networks. The first network, called an encoder, maps an input sequence of variable length into a point in a continuous vector space, resulting in a fixed-dimensional context vector. The other recurrent neural network, called a decoder, then generates a target sequence again of variable length starting from the context vector. This approach however has been found to be inefficient in

[Cho et al.2014a] when handling long sentences, due to the difficulty in learning a complex mapping between an arbitrary long sentence and a single fixed-dimensional vector.

In [Bahdanau et al.2014], a remedy to this issue was proposed by incorporating an attention mechanism to the basic encoder-decoder network. The attention mechanism in the encoder-decoder network frees the network from having to map a sequence of arbitrary length to a single, fixed-dimensional vector. Since this attention mechanism was introduced to the encoder-decoder network for machine translation, neural machine translation, which is purely based on neural networks to perform full end-to-end translation, has become competitive with the existing phrase-based statistical machine translation in many language pairs [Jean et al.2015, Gulcehre et al.2015, Luong et al.2015b].

Multilingual Neural Machine Translation

Existing machine translation systems, mostly based on a phrase-based system or its variants, work by directly mapping a symbol or a subsequence of symbols in a source language to its corresponding symbol or subsequence in a target language. This kind of mapping is strictly specific to a given language pair, and it is not trivial to extend this mapping to work on multiple pairs of languages.

A system based on neural machine translation, on the other hand, can be decomposed into two modules. The encoder maps a source sentence into a continuous representation, either a fixed-dimensional vector in the case of the basic encoder-decoder network or a set of vectors in the case of attention-based encoder-decoder network. The decoder then generates a target translation based on this source representation. This makes it possible conceptually to build a system that maps a source sentence in any language to a common continuous representation space and decodes the representation into any of the target languages, allowing us to make a multilingual machine translation system.

This possibility is straightforward to implement and has been validated in the case of basic encoder-decoder networks [Luong et al.2015a]. It is however not so, in the case of the attention-based encoder-decoder network, as the attention mechanism, or originally called the alignment function in [Bahdanau et al.2014], is conceptually language pair-specific. In [Dong et al.2015], the authors cleverly avoided this issue of language pair-specific attention mechanism by considering only a one-to-many translation, where each target language decoder embedded its own attention mechanism. Also, we notice that both of these works have only evaluated their models on relatively small-scale tasks, making it difficult to assess whether multilingual neural machine translation can scale beyond low-resource language translation.

Multi-Way, Multilingual Neural Machine Translation

In this paper, we first step back from the currently available multilingual neural translation systems proposed in [Luong et al.2015a, Dong et al.2015] and ask the question of whether the attention mechanism can be shared across multiple language pairs. As an answer to this question, we propose an attention-based encoder-decoder network that admits a shared attention mechanism with multiple encoders and decoders. We use this model for all the experiments, which suggests that it is indeed possible to share an attention mechanism across multiple language pairs.

The next question we ask is the following: in which scenario would the proposed multi-way, multilingual neural translation have an advantage over the existing, single-pair model? Specifically, we consider a case of the translation between a low-resource language pair. The experiments show that the proposed multi-way, multilingual model generalizes better than the single-pair translation model, when the amount of available parallel corpus is small. Furthermore, we validate that this is not only due to the increased amount of target-side, monolingual corpus.

Finally, we train a single model with the proposed architecture on all the language pairs from the WMT’15; English, French, Czech, German, Russian and Finnish. The experiments show that it is indeed possible to train a single attention-based network to perform multi-way translation.

2 Background: Attention-based Neural Machine Translation

The attention-based neural machine translation was proposed in [Bahdanau et al.2014]. It was motivated from the observation in [Cho et al.2014a] that a basic encoder-decoder translation model from [Cho et al.2014b, Sutskever et al.2014] suffers from translating a long source sentence efficiently. This is largely due to the fact that the encoder of this basic approach needs to compress a whole source sentence into a single vector. Here we describe the attention-based neural machine translation.

Neural machine translation aims at building a single neural network that takes as input a source sequence and generates a corresponding translation . Each symbol in both source and target sentences, or , is an integer index of the symbol in a vocabulary.

The encoder of the attention-based model encodes a source sentence into a set of context vectors

, whose size varies w.r.t. the length of the source sentence. This context set is constructed by a bidirectional recurrent neural network (RNN) which consists of a forward RNN and reverse RNN. The forward RNN reads the source sentence from the first token until the last one, resulting in the forward context vectors

, where

and is an embedding matrix containing row vectors of the source symbols. The reverse RNN in an opposite direction, resulting in , where

and

are recurrent activation functions such as long short-term memory units (LSTM,

[Hochreiter and Schmidhuber1997]

) or gated recurrent units (GRU,

[Cho et al.2014b]). At each position in the source sentence, the forward and reverse context vectors are concatenated to form a full context vector, i.e.,

(1)

The decoder, which is implemented as an RNN as well, generates one symbol at a time, the translation of the source sentence, based on the context set returned by the encoder. At each time step in the decoder, a time-dependent context vector is computed based on the previous hidden state of the decoder , the previously decoded symbol and the whole context set .

This starts by computing the relevance score of each context vector as

(2)

for all . can be implemented in various ways [Luong et al.2015b], but in this work, we use a simple single-layer feedforward network. This relevance score measures how relevant the -th context vector of the source sentence is in deciding the next symbol in the translation. These relevance scores are further normalized:

(3)

and we call the attention weight.

The time-dependent context vector is then the weighted sum of the context vectors with their weights being the attention weights from above:

(4)

With this time-dependent context vector , the previous hidden state and the previously decoded symbol , the decoder’s hidden state is updated by

(5)

where is a recurrent activation function.

The initial hidden state of the decoder is initialized based on the last hidden state of the reverse RNN:

(6)

where is a feedforward network with one or two hidden layers.

The probability distribution for the next target symbol is computed by

(7)

where is a parametric function that returns the unnormalized probability for the next target symbol being .

Training this attention-based model is done by maximizing the conditional log-likelihood

where the log probability inside the inner summation is from Eq. (7). It is important to note that the ground-truth target symbols are used during training. The entire model is differentiable, and the gradient of the log-likelihood function with respect to all the parameters

can be computed efficiently by backpropagation. This makes it straightforward to use stochastic gradient descent or its variants to train the whole model jointly to maximize the translation performance.

3 Multi-Way, Multilingual Translation

In this section, we discuss issues and our solutions in extending the conventional single-pair attention-based neural machine translation into multi-way, multilingual model.

Problem Definition

We assume source languages and target languages , and the availability of bilingual parallel corpora , each of which is a set of sentence pairs of one source and one target languages. We use and to indicate the source and target languages of the -th parallel corpus.

For each parallel corpus , we can directly use the log-likelihood function from Eq. (7) to define a pair-specific log-likelihood . Then, the goal of multi-way, multilingual neural machine translation is to build a model that maximizes the joint log-likelihood function Once the training is over, the model can do translation from any of the source languages to any of the target languages included in the parallel corpora.

3.1 Existing Approaches

Neural Machine Translation without Attention

In [Luong et al.2015a], the authors extended the basic encoder-decoder network for multitask neural machine translation. As they extended the basic encoder-decoder network, their model effectively becomes a set of encoders and decoders, where each of the encoder projects a source sentence into a common vector space. The point in the common space is then decoded into different languages.

The major difference between [Luong et al.2015a] and our work is that we extend the attention-based encoder-decoder instead of the basic model. This is an important contribution, as the attention-based neural machine translation has become de facto standard in neural translation literatures recently [Jean et al.2014, Jean et al.2015, Luong et al.2015b, Sennrich et al.2015b, Sennrich et al.2015a], by opposition to the basic encoder-decoder.

There are two minor differences as well. First, they do not consider multilinguality in depth. The authors of [Luong et al.2015a]

tried only a single language pair, English and German, in their model. Second, they only report translation perplexity, which is not a widely used metric for measuring translation quality. To more easily compare with other machine translation approaches it would be important to evaluate metrics such as BLEU, which counts the number of matched

-grams between the generated and reference translations.

One-to-Many Neural Machine Translation

The authors of [Dong et al.2015] earlier proposed a multilingual translation model based on the attention-based neural machine translation. Unlike this paper, they only tried it on one-to-many translation, similarly to earlier work by [Collobert et al.2011]

where one-to-many natural language processing was done. In this setting, it is trivial to extend the single-pair attention-based model into multilingual translation by simply having a single encoder for a source language and pairs of a decoder and attention mechanism (Eq. (

2)) for each target language. We will shortly discuss more on why, with the attention mechanism, one-to-many translation is trivial, while multi-way translation is not.

3.2 Challenges

A quick look at neural machine translation seems to suggest a straightforward path toward incorporating multiple languages in both source and target sides. As described earlier already in the introduction, the basic idea is simple. We assign a separate encoder to each source language and a separate decoder to each target language. The encoder will project a source sentence in its own language into a common, language-agnostic space, from which the decoder will generate a translation in its own language.

Unlike training multiple single-pair neural translation models, in this case, the encoders and decoders are shared across multiple pairs. This is computationally beneficial, as the number of parameters grows only linearly with respect to the number of languages (), in contrary to training separate single-pair models, in which case the number of parameters grows quadratically (.)

The attention mechanism, which was initially called a soft-alignment model in [Bahdanau et al.2014], aligns a (potentially non-contiguous) source phrase to a target word. This alignment process is largely specific to a language pair, and it is not clear whether an alignment mechanism for one language pair can also work for another pair.

The most naive solution to this issue is to have attention mechanisms that are not shared across multiple language pairs. Each attention mechanism takes care of a single pair of source and target languages. This is the approach employed in [Dong et al.2015], where each decoder had its own attention mechanism.

There are two issues with this naive approach. First, unlike what has been hoped initially with multilingual neural machine translation, the number of parameters again grows quadratically w.r.t. the number of languages. Second and more importantly, having separate attention mechanisms makes it less likely for the model to fully benefit from having multiple tasks [Caruana1997]

, especially for transfer learning towards resource-poor languages.

In short, the major challenge in building a multi-way, multilingual neural machine translation is in avoiding independent (i.e., quadratically many) attention mechanisms. There are two questions behind this challenge. The first one is whether it is even possible to share a single attention mechanism across multiple language pairs. The second question immediately follows: how can we build a neural translation model to share a single attention mechanism for all the language pairs in consideration?

Figure 1: One step of the proposed multi-way. multilingual Neural Machine Translation model, for the -th encoder and the -th decoder at time step . See Sec. 4 for details.

4 Multi-Way, Multilingual Model

We describe in this section a proposed multi-way, multilingual attention-based neural machine translation. The proposed model consists of encoders (see Eq. (1)), decoders (see Eqs. (5)–(7)) and a shared attention mechanism (see Eq. (2) in the single language pair case).

Encoders

Similarly to [Luong et al.2015b], we have one encoder per source language, meaning that a single encoder is shared for translating the language to multiple target languages. In order to handle different source languages better, we may use for each source language a different type of encoder, for instance, of different size (in terms of the number of recurrent units) or of different architecture (convolutional instead of recurrent.) This allows us to efficiently incorporate varying types of languages in the proposed multilingual translation model.

This however implies that the dimensionality of the context vectors in Eq. (1) may differ across source languages. Therefore, we add to the original bidirectional encoder from Sec. 2

, a linear transformation layer consisting of a weight matrix

and a bias vector

, which is used to project each context vector into a common dimensional space:

(8)

where and .

In addition, each encoder exposes two transformation functions and . The first transformer transforms a context vector to be compatible with a shared attention mechanism:

(9)

This transformer can be implemented as any type of parametric function, and in this paper, we simply apply an element-wise to .

The second transformer transforms the first context vector to be compatible with the initializer of the decoder’s hidden state (see Eq. (6)):

(10)

Similarly to , it can be implemented as any type of parametric function. In this paper, we use a feedforward network with a single hidden layer and share one network for all encoder-decoder pairs, like attention mechanism.

# Symbols # Sentence
# En Other Pairs
En-Fr 1.022b 2.213b 38.85m
En-Cs 186.57m 185.58m 12.12m
En-Ru 50.62m 55.76m 2.32m
En-De 111.77m 117.41m 4.15m
En-Fi 52.76m 43.67m 2.03m
Table 1: Statistics of the parallel corpora from WMT’15. Symbols are BPE-based sub-words.

Decoders

We first start with an initialization of the decoder’s hidden state. Each decoder has its own parametric function that maps the last context vector of the source encoder from Eq. (10) into the initial hidden state:

can be any parametric function, and in this paper, we used a feedforward network with a single hidden layer.

Each decoder exposes a parametric function that transforms its hidden state and the previously decoded symbol to be compatible with a shared attention mechanism. This transformer is a parametric function that takes as input the previous hidden state and the previous symbol and returns a vector for the attention mechanism:

(11)

which replaces in Eq. 2. In this paper, we use a feedforward network with a single hidden layer for each .

Given the previous hidden state , previously decoded symbol and the time-dependent context vector , which we will discuss shortly, the decoder updates its hidden state:

where affine-transforms the time-dependent context vector to be of the same dimensionality as the decoder. We share a single affine-transformation layer , for all the decoders in this paper.

Once the hidden state is updated, the probability distribution over the next symbol is computed exactly as for the pair-specific model (see Eq. (7).)

Attention Mechanism

Unlike the encoders and decoders of which there is an instance for each language, there is only a single attention mechanism, shared across all the language pairs. This shared mechanism uses the attention-specific vectors and from the encoder and decoder, respectively.

The relevance score of each context vector is computed based on the decoder’s previous hidden state and previous symbol :

These scores are normalized according to Eq. (3) to become the attention weights .

With these attention weights, the time-dependent context vector is computed as the weighted sum of the original context vectors:

See Fig. 1 for the illustration.

Size Single Single+DF Multi
EnFi 100k 5.06/3.96 4.98/3.99 6.2/5.17
200k 7.1/6.16 7.21/6.17 8.84/7.53
400k 9.11/7.85 9.31/8.18 11.09/9.98
800k 11.08/9.96 11.59/10.15 12.73/11.28
DeEn 210k 14.27/13.2 14.65/13.88 16.96/16.26
420k 18.32/17.32 18.51/17.62 19.81/19.63
840k 21/19.93 21.69/20.75 22.17/21.93
1.68m 23.38/23.01 23.33/22.86 23.86/23.52
EnDe 210k 11.44/11.57 11.71/11.16 12.63/12.68
420k 14.28/14.25 14.88/15.05 15.01/15.67
840k 17.09/17.44 17.21/17.88 17.33/18.14
1.68m 19.09/19.6 19.36/20.13 19.23/20.59
Table 2: BLEU scores where the target pair’s parallel corpus is constrained to be 5%, 10%, 20% and 40% of the original size. We report the BLEU scores on the development and test sets (separated by /) by the single-pair model (Single), the single-pair model with monolingual corpus (Single+DF) and the proposed multi-way, multilingual model (Multi).

5 Experiment Settings

5.1 Datasets

We evaluate the proposed multi-way, multilingual translation model on all the pairs available from WMT’15–English (En) French (Fr), Czech (Cs), German (De), Russian (Ru) and Finnish (Fi)–, totalling ten directed pairs. For each pair, we concatenate all the available parallel corpora from WMT’15 and use it as a training set. We use newstest-2013 as a development set and newstest-2015 as a test set, in all the pairs other than Fi-En. In the case of Fi-En, we use newsdev-2015 and newstest-2015 as a development set and test set, respectively.

Data Preprocessing

Each training corpus is tokenized using the tokenizer script from the Moses decoder. The tokenized training corpus is cleaned following the procedure in [Jean et al.2015]. Instead of using space-separated tokens, or words, we use sub-word units extracted by byte pair encoding, as recently proposed in [Sennrich et al.2015b]. For each and every language, we include 30k sub-word symbols in a vocabulary. See Table 1 for the statistics of the final, preprocessed training corpora.

Evaluation Metric

We mainly use BLEU as an evaluation metric using the multi-bleu script from Moses. BLEU is computed on the tokenized text after merging the BPE-based sub-word symbols. We further look at the average log-probability assigned to reference translations by the trained model as an additional evaluation metric, as a way to measure the model’s density estimation performance free from any error caused by approximate decoding.

5.2 Two Scenarios

Low-Resource Translation

First, we investigate the effect of the proposed multi-way, multilingual model on low-resource language-pair translation. Among the five languages from WMT’15, we choose En, De and Fi as source languages, and En and De as target languages. We control the amount of the parallel corpus of each pair out of three to be 5%, 10%, 20% and 40% of the original corpus. In other words, we train four models with different sizes of parallel corpus for each language pair (En-De, De-En, Fi-En.)

As a baseline, we train a single-pair model for each multi-way, multilingual model. We further finetune the single-pair model to incorporate the target-side monolingual corpus consisting of all the target side text from the other language pairs (e.g., when a single-pair model was trained on Fi-En, the target-side monolingual corpus consists of the target sides from De-En.) This is done by the recently proposed deep fusion [Gulcehre et al.2015]. The latter is included to tell whether any improvement from the multilingual model is simply due to the increased amount of target-side monolingual corpus.

Large-scale Translation

We train one multi-way, multilingual model that has five encoders and five decoders, corresponding to the five languages from WMT’15; En, Fr, De, Cs, Ru, Fi En, Fr, De, Cs, Ru, Fi. We use the full corpora for all of them.

5.3 Model Architecture

Each symbol, either source or target, is projected on a 620-dimensional space. The encoder is a bidirectional recurrent neural network with 1,000 gated recurrent units (GRU) in each direction, and the decoder is a recurrent neural network with also 1,000 GRU’s. The decoder’s output function from Eq. (7) is a feedforward network with 1,000 hidden units. The dimensionalities of the context vector in Eq. (8), the attention-specific context vector in Eq. (9) and the attention-specific decoder hidden state in Eq. (11) are all set to 1,200.

We use the same type of encoder for every source language, and the same type of decoder for every target language. The only difference between the single-pair models and the proposed multilingual ones is the numbers of encoders and decoders . We leave those multilingual translation specific components, such as the ones in Eqs. (8)–(11), in the single-pair models in order to keep the number of shared parameters constant.

Fr (39m) Cs (12m) De (4.2m) Ru (2.3m) Fi (2m) Dir En En En En En En En En En En (a) BLEU Dev Single 27.22 26.91 21.24 15.9 24.13 20.49 21.04 18.06 13.15 9.59 Multi 26.09 25.04 21.23 14.42 23.66 19.17 21.48 17.89 12.97 8.92 Test Single 27.94 29.7 20.32 13.84 24 21.75 22.44 19.54 12.24 9.23 Multi 28.06 27.88 20.57 13.29 24.20 20.59 23.44 19.39 12.61 8.98 (b) LL Dev Single -50.53 -53.38 -60.69 -69.56 -54.76 -61.21 -60.19 -65.81 -88.44 -91.75 Multi -50.6 -56.55 -54.46 -70.76 -54.14 -62.34 -54.09 -63.75 -74.84 -88.02 Test Single -43.34 -45.07 -60.03 -64.34 -57.81 -59.55 -60.65 -60.29 -88.66 -94.23 Multi -42.22 -46.29 -54.66 -64.80 -53.85 -60.23 -54.49 -58.63 -71.26 -88.09
Table 3: (a) BLEU scores and (b) average log-probabilities for all the five languages from WMT’15.

5.4 Training

Basic Settings

We train each model using stochastic gradient descent (SGD) with Adam [Kingma and Ba2015] as an adaptive learning rate algorithm. We use the initial learning rate of

and leave all the other hyperparameters as suggested in

[Kingma and Ba2015]. Each SGD update is computed using a minibatch of 80 examples, unless the model is parallelized over two GPUs, in which case we use a minibatch of 60 examples. We only use sentences of length up to 50 symbols. We clip the norm of the gradient to be no more than [Pascanu et al.2012]. All training runs are early-stopped based on BLEU on the development set. As we observed in preliminary experiments better scores on the development set when finetuning the shared parameters and output layers of the decoders in the case of multilingual models, we do this for all the multilingual models. During finetuning, we clip the norm of the gradient to be no more than .

Schedule

As we have access only to bilingual corpora, each sentence pair updates only a subset of the parameters. Excessive updates based on a single language pair may bias the model away from the other pairs. To avoid it, we cycle through all the language pairs, one pair at a time, in FiEn, DeEn, FrEn, CsEn, RuEn order.111 indicates simultaneous updates on two GPUs.

Model Parallelism

The size of the multilingual model grows linearly w.r.t. the number of languages. We observed that a single model that handles five source and five target languages does not fit in a single GPU during training. We address this by distributing computational paths according to different translation pairs over multiple GPUs. The shared parameters, mainly related to the attention mechanism, is duplicated on both GPUs. The implementation was based on the work in [Ding et al.2014].

6 Results and Analysis

Low-Resource Translation

It is clear from Table 2 that the proposed model (Multi) outperforms the single-pair one (Single) in all the cases. This is true even when the single-pair model is strengthened with a target-side monolingual corpus (Single+DF). This suggests that the benefit of generalization from having multiple languages goes beyond that of simply having more target-side monolingual corpus. The performance gap grows as the size of target parallel corpus decreases.

Large-Scale Translation

In Table 3, we observe that the proposed multilingual model outperforms or is comparable to the single-pair models for the majority of the all ten pairs/directions considered. This happens in terms of both BLEU and average log-probability. This is encouraging, considering that there are twice more parameters in the whole set of single-pair models than in the multilingual model.

It is worthwhile to notice that the benefit is more apparent when the model translates from a foreign language to English. This may be due to the fact that all of the parallel corpora include English as either a source or target language, leading to a better parameter estimation of the English decoder. In the future, a strategy of using a pseudo-parallel corpus to increase the amount of training examples for the decoders of other languages [Sennrich et al.2015a] should be investigated to confirm this conjecture.

7 Conclusion

In this paper, we proposed multi-way, multilingual attention-based neural machine translation. The proposed approach allows us to build a single neural network that can handle multiple source and target languages simultaneously. The proposed model is a step forward from the recent works on multilingual neural translation, in the sense that we support attention mechanism, compared to [Luong et al.2015a] and multi-way translation, compared to [Dong et al.2015]. Furthermore, we evaluate the proposed model on large-scale experiments, using the full set of parallel corpora from WMT’15.

We empirically evaluate the proposed model in large-scale experiments using all five languages from WMT’15 with the full set of parallel corpora and also in the settings with artificially controlled amount of the target parallel corpus. In both of the settings, we observed the benefits of the proposed multilingual neural translation model over having a set of single-pair models. The improvement was especially clear in the cases of translating low-resource language pairs.

We observed the larger improvements when translating to English. We conjecture that this is due to a higher availability of English in most parallel corpora, leading to a better parameter estimation of the English decoder. More research on this phenomenon in the future will result in further improvements from using the proposed model. Also, all the other techniques proposed recently, such as ensembling and large vocabulary tricks, need to be tried together with the proposed multilingual model to improve the translation quality even further. Finally, an interesting future work is to use the proposed model to translate between a language pair not included in a set of training corpus.

Acknowledgments

The authors would like to thank the developers of Theano

[Bergstra et al.2010, Bastien et al.2012] and Blocks [van Merriënboer et al.2015]. We acknowledge the support of the following organizations for research funding and computing support: NSERC, Samsung, IBM, Calcul Québec, Compute Canada, the Canada Research Chairs, CIFAR and TUBITAK-2214a.

References