Difference between revisions of "Ravi and Knight, ACL 2011"
Line 43: | Line 43: | ||
</math> | </math> | ||
− | where <math>P_0(s_i|t_i)</math> is a base distribution (which is set to uniform) and <math>C_{history}</math> represents the count events occurring in the history. Finally, a Dirichlet prior is applied, which is parametrized by <math>\alpha</math>. | + | where <math>P_0(s_i|t_i)</math> is a base distribution (which is set to uniform) and <math>C_{history}</math> represents the count events occurring in the history. Finally, a Dirichlet prior is applied, which is parametrized by <math>\alpha</math>. |
== Experimental Results == | == Experimental Results == | ||
+ | |||
== Related Work == | == Related Work == |
Revision as of 21:51, 30 October 2011
Contents
Citation
S. Ravi and K. Knight. 2011. Deciphering Foreign Language. In Proceedings of ACL.
Online version
Summary
This work addresses the Machine Translation problem without resorting to parallel training data.
This is done by looking at the Machine Translation task from the decipherment perspective, where a sentence in the source language is viewed as the sentence target, but encoded in some unknown symbols.
Experimental showed that, while the results using monolingual data were considerably lower than those using bilingual data if the same amount of data is used, large amounts of monolingual data can be used to create models that perform similarly to systems that use smaller amounts of bilingual data. This is encouraging, since bilingual data is a scarce resource for most language pairs and domains, while monolingual data is much more abundant.
Description of the Method
Word Alignments using parallel corpora is viewed as a maximization problem with latent word alignments for a set of sentence pairs , given by:
where are the translation parameters of the model.
When only monolingual corpora is used, for each source sentence , there isn't an exact target sentence that is aligned to the source sentence. Thus, like the word alignments, this work views the hidden target sentence as an additional latent variable. Hence, the previous equation can be rewritten as:
where P(t) is the probability of a target sentence , modeled by the a language model. The large number of possible latent variable that is generated from this model is tacked using Gibbs sampling.
As for the translation model , two models are presented.
The first model is a simple model that accounts for word substitutions, insertions, deletions and relative distortion, but does not incorporate word fertility and absolute distortion as in IBM Model 3. The decision to leave out the word fertility and absolute distortion is due to the fact that EM training would be intractable due to the large sizes for the fertility and distortion parameter tables and the resulting derivation lattices.
The second model accounts for the same issues addressed in IBM Model 3 and a Bayesian method is used instead of EM (which is intractable). In this method, model parameters are learned using a Chinese Restaurant Process, rather than using expected counts. For instance, the translation parameters , which is generally calculated as the ratio between the number of expected observations of and , , and the number of observations of , , is now formulated as:
where is a base distribution (which is set to uniform) and represents the count events occurring in the history. Finally, a Dirichlet prior is applied, which is parametrized by .