Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
courses:rg:transductive_learning_for_statistical_machine_translation [2010/12/08 21:48] jawaid |
courses:rg:transductive_learning_for_statistical_machine_translation [2010/12/08 21:49] jawaid |
||
---|---|---|---|
Line 16: | Line 16: | ||
===== Comments ===== | ===== Comments ===== | ||
- | * The Paper very well describes the transductive learning algorithm, **Algorithm 1** which is inspired by Yarowsky algorithm [1]. | ||
- | * In algorithm 1, the translation model is estimated based on the sentence pairs in bilingual data L. Then a set of source language sentences, U, is translated based on the current model. A subset of good transaltions and their sources, Ti, is selected on each iteration and added to the training data. These sentence pairs are replaces in each iteration and only the original data, L, is fixed throughout | + | |
- | * Algorithm | + | |
- | * Estimate function estimates the model parameters or in other words perform training of the system. The authors used three different model for parameters estimation. | + | |
- | * Scoring | + | |
- | * Selection | + | |
- | * Data filtering | + | |
- | | + | * Data filtering is performed on both bilingual and monolingual data to keep only that part of the data which is relevant to the test data. |
+ | |||
+ | | ||
===== Suggested Additional Reading ===== | ===== Suggested Additional Reading ===== | ||
* [1] D. Yarowsky. 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. In Proc. ACL | * [1] D. Yarowsky. 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. In Proc. ACL | ||
- | |||
* [2] | * [2] | ||