Word Alignment via Submodular Maximization over Matroids

We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment components while remaining computationally efficient, thanks to the power and generality of submodular functions. We show that submodularity naturally arises when modeling word fertility. Experiments on the English-French Hansards alignment task show that our approach achieves lower alignment error rates compared to conventional matching based approaches.

• Type: Journal
• Year: 2011
• Where: ACL
• Authors: Hui Lin, Jeff Bilmes
• Keywords: ACL 2011, Alignment Problem, Computational Linguistics, Submodular Functions, Word Alignment