Sciweavers

Share
ACL
2011

Word Alignment via Submodular Maximization over Matroids

8 years 2 months ago
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.
Hui Lin, Jeff Bilmes
Added 24 Aug 2011
Updated 24 Aug 2011
Type Journal
Year 2011
Where ACL
Authors Hui Lin, Jeff Bilmes
Comments (0)
books