Difference between revisions of "neural Machine Translation: Jointly Learning to Align and Translate"
(→Encoding) 
m (Conversion script moved page Neural Machine Translation: Jointly Learning to Align and Translate to neural Machine Translation: Jointly Learning to Align and Translate: Converting page titles to lowercase) 
(No difference)

Latest revision as of 09:46, 30 August 2017
Contents
Introduction
In this paper Bahdanau et al (2015) present a new way of using neural networks to perform machine translation. Rather than using the typical RNN encoderdecoder model with fixedlength intermediate vectors, they proposed a method that uses a joint learning process for both alignment and translation, and does not restrict intermediate encoded vectors to any specific fixed length. The result is a translation method that is comparable in performance to phrasebased systems (the stateoftheart effective models that do not use a neural network approach), additionally it has been found the proposed method is more effective compared to other neural network models when applied to long sentences.
In this paper, for the activation function of an RNN, the gated hidden unit is used which is similar to a long shortterm memory (LSTM), but is able to better maintain contextual information from early until late in a sentence. Additionally, in the introduced method, the encoder assigns a contextdependent vector, or annotation, to every source word. The decoder then selectively combines the most relevant annotations to generate each target word; this implements a mechanism of attention in the decoder.
Previous methods
In order to better appreciate the value of this paper's contribution, it is important to understand how earlier techniques approached the problem of machine translation using neural networks.
In machine translation, the problem at hand is to identify the target sentence [math]y[/math] (in natural language [math]B[/math]) that is the most likely corresponding translation to the source sentence [math]x[/math] (in natural language [math]A[/math]). The authors compactly summarize this problem using the formula [math] \arg\max_{y} P(yx)[/math].
Recent Neural Network approaches proposed by researchers such as Kalchbrenner and Blunsom<ref> Kalchbrenner N, Blunsom P. Recurrent Continuous Translation Models[C]//EMNLP. 2013: 17001709. </ref>, Cho et al.<ref> Cho K, van Merriënboer B, Bahdanau D, et al. On the properties of neural machine translation: Encoderdecoder approaches[J]. arXiv preprint arXiv:1409.1259, 2014. </ref>, Sutvesker et al.<ref> Sutskever I, Vinyals O, Le Q V V. Sequence to sequence learning with neural networks[C]//Advances in neural information processing systems. 2014: 31043112. </ref> has built a neural machine translation to directly learn the conditional probability distribution between input [math]x[/math] and output [math]y[/math]. Experiments at current show that neural machine translation or extension of existing translation systems using RNNs perform better compared to state of the art systems.
Encoding
Typically, the encoding step iterates through the input vectors in the representation of a source sentence [math]x[/math] and updates a hidden state with each new token in the input: [math]h_t = f(x_t, h_{t1})[/math], for some nonlinear function [math]f[/math]. After the entire input is read, the resulting fixedlength representation of the entire input sentence [math]x[/math] is given by a nonlinear function [math]q[/math] of all of the hidden states: [math]c = q(\{h_1, \ldots, h_{T_x}\})[/math]. Different methods would use different nonlinear functions and different neural networks, but the essence of the approach is common to all. A common choice is to set [math]c = h_T[/math]. (i.e. the final hidden state computed by the encoding RNN).
Decoding
Decoding the fixedlength representation [math]c[/math] of [math]x[/math] is done by predicting one token of the target sentence [math]y[/math] at a time, using the knowledge of all previously predicted words so far. The decoder defines a probability distribution over the possible sentences using a product of conditional probabilities [math]P(y) = \Pi_t P(y_t\{y_1, \ldots, y_{t1}\},c)[/math].
In the neural network approach, the conditional probability of the next output term given the previous ones [math]P(y_t  \{y_1, \ldots, y_{t1}\},c)[/math] is given by the evaluation of a nonlinear function [math]g(y_{t1}, s_t, c)[/math].
The proposed method
The method proposed here is different from the traditional approach because it bypasses the fixedlength context vector [math]c[/math] altogether, and instead aligns the tokens of the translated sentence [math]y[/math] directly with the corresponding tokens of source sentence [math]x[/math] as it decides which parts might be most relevant. To accommodate this, a different neural network structure needs to be set up.
Encoding
The proposed model does not use an ordinary recurrent neural network to encode the target sentence [math]x[/math], but instead uses a bidirectional recurrent neural network (BiRNN): this is a model that consists of both a forward and backward RNN, where the forward RNN takes the input tokens of [math]x[/math] in the correct order when computing hidden states, and the backward RNN takes the tokens in reverse. Thus each token of [math]x[/math] is associated with two hidden states, corresponding to the states it produces in the two RNNs. The annotation vector [math]h_j[/math] of the token [math]x_j[/math] in [math]x[/math] is given by the concatenation of these two hidden states vectors. See Fig. 1 for the graphical illustration of the proposed model.
Aligment
An alignment model (in the form of a neural network) is used to measure how well each annotation [math]h_j[/math] of the input sentence corresponds to the current state of constructing the translated sentence (represented by the vector [math]s_{i1}[/math], the hidden state of the RNN that identifies the tokens in the output sentence [math]y[/math]. This is stored as the energy score [math]e_{ij} = a(s_{i1}, h_j)[/math].
The energy scores from the alignment process are used to assign weights [math]\alpha_{ij}[/math] to the annotations, effectively trying to determine which of the words in the input is most likely to correspond to the next word that needs to be translated in the current stage of the output sequence:
[math]\alpha_{ij} = \frac{\exp(e_{ij})}{\Sigma_k \exp(e_{ik})}[/math]
The weights are then applied to the annotations to obtain the current context vector input:
[math]c_i = \Sigma_j \alpha_{ij}h_j[/math]
Note that this is where we see one major difference between the proposed method and the previous ones: The context vector, or the representation of the input sentence, is not one fixedlength static vector [math]c[/math]; rather, every time we translate a new word in the sentence, a new representation vector [math]c_i[/math] is produced (though the dimension of [math]c_i[/math] is still fixed to 2*n). This vector depends on the most relevant words in the source sentence to the current state in the translation (hence it is automatically aligning) and allows the input sentence to have a variable length representation (since each annotation in the input representation produces a new context vector [math]c_i[/math]). Put more intuitively, instead of using the final hidden state computed during the encoding phase as the context vector, all of the hidden states are retained during encoding to form the annotations, and a different linear combination of these annotations is used as the context vector during the decoding of each output word in the translation. It is also worth noting the method used by Sutskever et al. (2014) to reverse the order of the input sentence during encoding can be seen as a rough heuristic for implementing this sort of alignment.
Decoding
The decoding is done by using an RNN to model a probability distribution on the conditional probabilities
[math]P(y_i  y_1, \ldots, y_{i1}, x) = g(y_{i1}, s_i, c_i)[/math]
where here, [math]s_i[/math] is the RNN hidden state at the current time step, computed by
[math]s_i = f (s_{i1}, y_{i1}, c_i)[/math]
and [math]c_i[/math] is the current context vector representation as discussed above under Alignment.
Once the encoding and alignment are done, the decoding step is fairly straightforward and corresponds with the typical approach of neural network translation systems, although the context vector representation is now different at each step of the translation.
Experiment Settings
The ACL WMT '14 dataset containing English to French translation were used to assess the performance of the Bahdanau et al(2015)'s <ref>Bahdanau, Dzmitry, Kyunghyun Cho, and Yoshua Bengio. "Neural machine translation by jointly learning to align and translate." arXiv preprint arXiv:1409.0473 (2014).</ref> RNNSearch and RNN EncoderDecoder proposed by Cho et al (2014) <ref>Cho, K., van Merrienboer, B., Gulcehre, C., Bougares, F., Schwenk, H., and Bengio, Y. (2014a). Learning phrase representations using RNN encoderdecoder for statistical machine translation. In Proceedings of the Empiricial Methods in Natural Language Processing (EMNLP 2014).</ref>.
The WMT '14 dataset actually contains the following corpora, totaling (850M words):
 Europarl (61M words)
 News Commentary (5.5M words)
 UN (421M words)
 Crawled corpora (90M and 272.5 words)
This was reduced to 348M using data selection method described by Axelord, et al (2011)<ref>Axelrod, A., He, X., and Gao, J. (2011). Domain adaptation via pseudo indomain data selection. In Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 355–362. Association for Computational Linguistics.</ref>.
Both models were trained in the same manner, by using minibatch stochastic gradient descent (SGD) with size 80 and AdaDelta. Once the model has finished training, beam search is used to decode the computed probability distribution to obtain a translation output.
Results
The authors performed some experiments using the proposed model of machine translation, calling it "RNNsearch", in comparison with the previous kind of model, referred to as "RNNencdec". Both models were trained on the same datasets for translating English to French, with one dataset containing sentences of length up to 30 words, and the other containing sentences with at most 50. They used a shortlist of 30,000 most frequent words in each language to train their models and any word not included in the shortlist is mapped to a special token representing unknown word.
Quantitatively, the RNNsearch scores exceed RNNencdec by a clear margin. The distinction is particularly strong in longer sentences, which the authors note to be a problem area for RNNencdec  information gets lost when trying to "squash" long sentences into fixedlength vector representations.
The following graph, provided in the paper, shows the performance of RNNsearch compared with RNNencdec, based on the BLEU scores for evaluating machine translation.
Qualitatively, the RNNsearch method does a good job of aligning words in the translation process, even when they need to be rearranged in the translated sentence. Long sentences are also handled very well: while RNNencdec is shown to typically lose meaning and effectiveness after a certain number of words into the sentence, RNNsearch seems robust and reliable even for unusually long sentences.
Conclusion and Comments
Overall, the algorithm proposed by the authors gives a new and seemingly useful approach towards machine translation, particularly for translating long sentences.
The performance appears to be good, but it would be interesting to see if it can be maintained when translating between languages that are not as closely aligned naturally as English and French usually are. The authors briefly refer to other languages (such as German) but do not provide any experiments or detailed comments to describe how the algorithm would perform in such cases.
It is also interesting to note that, while the performance was always shown to be better for RNNsearch than for the older RNNencdec model, the former also includes more hidden units overall in its models than the latter. RNNencdec was mentioned as having 1000 hidden units for each of its encoding and decoding RNNs, giving a total of 2000; meanwhile, RNNsearch had 1000 hidden units for each the forward and backward RNNs in encoding, as well as 1000 more for the decoding RNN, giving a total of 3000. This is perhaps a worthy point to take into consideration when judging the relative performance of the two models objectively.
Compare to some other algorithms, the performance of proposed algorithm for rare words, even in English to French translation is not good enough. For long sentences with large number of rare words the algorithm which uses a deep LSTM to encode the input sequence and a separate deep LSTM to output the translation works more accurate with larger BLEU score. <ref> Sutskever I, Le Q, Vinyals O, Zaremba W (1997).Addressing the Rare Word Problem in Neural Machine Translation, </ref>,.
Another approach to explaining the performance gains of RNNsearch over RNNencdec is due to RNNsearch's usage of the BiDirectional RNN (BiRNN) as both encoder and decoder. As explained by Schuster and Paliwal (1997) <ref>Schuster, M. and Paliwal, K. K. (1997). Bidirectional recurrent neural networks. Signal Processing, IEEE Transactions on, 45 (11), 2673–2681</ref>, compared to traditional RNN which only explores past data, BiRNN considers both past and future contexts.
One of the main drawbacks of the method is that, since the complexity of training increases as the number of target words increases, the number of target worlds must be limited (3000080000). Since most languages are much larger than this, there may be at least a few words in sentences that are not covered by the shortlist (especially for languages with a rich set of words).
Reference
<references />