Elamur Research⌕
☰
home / papers / 2006 / Alignment by Agreement

Alignment by Agreement

Summary

The paper addresses unsupervised word alignment for statistical machine translation. The standard pipeline trains two directional aligners separately, often GIZA++ IBM model 4, and intersects their outputs afterwards. Liang, Taskar and Klein instead train two simple, mirror-image sequence-based models (E→F and F→E HMMs) together. The training objective adds the log-probability that both models choose the same alignment to the usual sum of their data log-likelihoods. This yields an EM-like procedure. Its M-step splits into ordinary per-model updates, but its E-step combines both models' posteriors. Exact computation of that combined E-step is #P-complete, so the authors use a heuristic approximation. On the English-French Hansards task, the jointly trained HMMs reach 4.9% AER. The authors report this as the best published unsupervised result at the time, comparable to supervised aligners. The method is no harder to implement or slower to train than two standard HMMs. The work matters because cheap, simple models trained to agree can beat a complex fertility-based system, and the same coupling idea applies to other pairs of tractable latent-variable models.

Key points

  • Joint training cuts AER by 32% compared with intersecting two independently trained models. A jointly trained HMM pair cuts AER by 29% compared with symmetrized GIZA++ IBM model 4.
  • On the English-French Hansards task, the method reaches 4.9% AER. For independently trained HMMs, intersection alone lowers AER from about 11% to 7%.
  • In a Figure 1 example with models trained on 1.1 million sentences, the intersected AER drops from 7.6 to 5.7. The rare word "cojo" stops acting as a garbage collector.
  • Implementation details of the HMM aligner:
    • The null probability is set to 1/(I+1), depending on English sentence length.
    • Distortion uses 11 offset buckets, from ≤−5 to ≥5.
    • There are three separate distortion sets: one governs transitions into the first state, another governs transitions out of the final state, and a third covers every remaining transition.
  • In a downstream test, 100K Europarl sentences were aligned and used with Pharaoh, then evaluated on 3000 test sentences of length 5–15. BLEU rose only slightly, from 0.3035 with GIZA++ model 4 to 0.3051.

Interesting ideas

  • I1. Move agreement into training. If combining two models at test time helps, add a term that rewards their agreement to the training objective itself. This could be useful for any pair of complementary unsupervised models, such as two directions or two views of the data.
  • I2. Agreement as a shared-output probability. Measuring agreement as the probability that both models pick the same output keeps the M-step decoupled. Each model keeps its usual update and only the E-step changes, so existing EM code can be reused almost unchanged.
  • I3. A common output space for asymmetric models. Rewriting directional alignments as sets of binary edge indicators lets two structurally different models share one output space. This is a general recipe for comparing or coupling models whose native outputs differ.
  • I4. Approximate an intractable coupling heuristically. When the exact joint E-step is intractable, a heuristic approximation can still work well in practice. The lesson is to test a pragmatic approximation before investing in heavy sampling or variational inference.
  • I5. Error analysis that informs model design. The authors identify specific failure types: rare words acting as garbage collectors, a monotonicity bias from context-free distortion, and "stepping stone" alignments. Naming failures this concretely points directly to the next modelling improvements.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Machine translation · Natural language processing

Cited by

231 papers of our library cite it (of the 140673 whose bibliographies we read); 13 of them have a page here, 218 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{liang2006alignment,
  title = {{Alignment by Agreement}},
  author = {Liang, Percy and Taskar, Ben and Klein, Dan},
  booktitle = {Proceedings of the Human Language Technology Conference of the NAACL, Main Conference},
  year = {2006},
  doi = {10.3115/1220835.1220849},
  url = {https://doi.org/10.3115/1220835.1220849}
}

References

14 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Avrim Blum and Tom Mitchell. 1998. Combining Labeled and Unlabeled Data with Co-training. In Proceedings of the COLT 1998. find our card
  2. Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, and Robert L. Mercer. 1994. The Mathematics of Statistical Machine Translation: Parameter Estimation. Computational Linguistics, 19:263–311. find
  3. Michael Collins and Yoram Singer. 1999. Unsupervised Models for Named Entity Classification. In Proceedings of EMNLP 1999. find
  4. Abraham Ittycheriah and Salim Roukos. 2005. A maximum entropy word aligner for arabic-english machine translation. In Proceedings of HLT-EMNLP. find
  5. Dan Klein and Christopher D. Manning. 2004. Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency. In Proceedings of ACL 2004. find
  6. Philipp Koehn, Franz Josef Och, and Daniel Marcu. 2003. Statistical Phrase-Based Translation. In Proceedings of HLT-NAACL 2003. find
  7. E. Matusov, Zens. R., and H. Ney. 2004. Symmetric word alignments for statistical machine translation. In Proceedings of the 20th International Conference on Computational Linguistics, August. find
  8. Robert C. Moore. 2004. Improving IBM Word Alignment Model 1. In Proceedings of ACL 2004. find
  9. Robert C. Moore. 2005. A discriminative framework for bilingual word alignment. In Proceedings of EMNLP. find
  10. Hermann Ney and Stephan Vogel. 1996. HMM-Based Word Alignment in Statistical Translation. In COLING. find
  11. Franz Josef Och and Hermann Ney. 2003. A Systematic Comparison of Various Statistical Alignment Models. Computational Linguistics, 29:19–51. find
  12. Ben Taskar, Simon Lacoste-Julien, and Dan Klein. 2005. A Discriminative Matching Approach to Word Alignment. In Proceedings of EMNLP 2005. find
  13. L. G. Valiant. 1979. The complexity of computing the permanent. Theoretical Computer Science, 8:189–201. find
  14. Appendix: Derivation of agreement EM To simplify notation, we drop the explicit reference to the parameters θ. Lower bound the objective in Equation 3 by introducing a distribution q(z; x) and using the concavity of log: find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/papers/liang-2006-alignment-agreement/