Submodularity for data selection in statistical machine translation

EMNLP 2014 - 2014 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2014, Pages 131-141

  Kirchhoff, Katrin ^a   Bilmes, Jeff ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER AIDED LANGUAGE TRANSLATION; DATA REDUCTION; LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH TRANSMISSION;

BASELINE METHODS; MATHEMATICAL PERFORMANCE; NATURAL LANGUAGE PROCESSING; SELECTION ALGORITHM; STATISTICAL MACHINE TRANSLATION; SUBMODULAR FUNCTIONS; SUBMODULAR OPTIMIZATIONS; UNIFIED FRAMEWORK;

TRANSLATION (LANGUAGES);

EID: 84925983202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. [Ambati et al.2010] V. Ambati, S. Vogel, and J. Carbonell. 2010. Active learning and crowd-sourcing for machine translation. In Proceedings of LREC, pages 2169-2174, Valletta, Malta.
2. [Axelrod et al.2011] A. Axelrod, X. He, and J. Gao. 2011. Domain adaptation via pseudo in-domain data selection. In Proceedings of EMNLP, pages 355- 362, Edinburgh, Scotland.
3. [Biçici and Yuret2011] E. Biçici and D. Yuret. 2011. Instance selection for machine translation using feature decay algorithms. In Proceedings of the 6th Workshop on Statistical Machine Translation, pages 272-283.
4. [Biçici2013] E. Biçici. 2013. Feature decay algorithms for fast deployment of accurate statistical machine translation systems. In Proceedings of the 8th Workshop on Statistical Machine Translation, pages 78- 84.
5. [Biçici2011] E. Biçici. 2011. The Regression Model of Machine Translation. Ph.D. thesis, KOÇ University.
6. [Bloodgood and Callison-Burch2010] M. Bloodgood and C. Callison-Burch. 2010. Bucking the trend: large-scale cost-focused active learning for statistical machine translation. In Proceedings of ACL, pages 854-864.
7. [Callison-Burch et al.2005] Chris Callison-Burch, Colin Bannard, and Josh Schroeder. 2005. Scaling phrase-based statistical machine translation to larger corpora and longer phrases. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pages 255-262. Association for Computational Linguistics.
8. [Cao and Khudanpur2012] Y. Cao and S. Khudanpur. 2012. Sample selection for large-scale MT discriminative training. In Proceedings of AMTA.
9. [Conforti and Cornuejols1984] M. Conforti and G. Cornuejols. 1984. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Applied Mathematics, 7(3):251- 274.
10. [Dasgupta and Hsu2008] S. Dasgupta and D. Hsu. 2008. Hierarchical sampling for active learning. In Proceedings of ICML.
11. [Eck et al.2005] M. Eck, S. Vogel, and A.Waibel. 2005. Low cost portability for statistical machine translation based on n-gram frequency and tf-idf. In Proceedings of the 10th Machine Translation Summit X, pages 227-234.
12. [Edmonds1970] J. Edmonds, 1970. Combinatorial Structures and their Applications, chapter Submodular functions, matroids and certain polyhedra, pages 69-87. Gordon and Breach.
13. [Feige1998] U. Feige. 1998. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634-652.
14. [Fujishige2005] S. Fujishige. 2005. Submodular functions and optimization. Annals of Discrete Mathematics, volume 58. Elsevier Science.
15. [Galley and Manning2008] M. Galley and C. D. Manning. 2008. A simple and effective hierarchical phrase reordering model. In Proceedings of EMNLP, pages 847-855.
16. [Habash et al.2009] N. Habash, O. Rambow, and R. Roth. 2009. A toolkit for Arabic tokenization, diacritization, morphological disambiguation, POS tagging, stemming and lemmatization. In Proceedings of the MEDAR conference, pages 102-109.
17. [Haffari et al.2009] G. Haffari, M. Roy, and A. Sarkar. 2009. Active learning for statistical machine translation. In Proceedings of HLT, pages 415-423.
18. [Hildebrand et al.2005] A. Hildebrand, M. Eck, S. Vogel, and A. Waibel. 2005. Adaptation of the translation model for statistical machine translation based on information retrieval. In Proceedings of EAMT, pages 133-142.
19. [Ittycheriah and Roukos2007] A. Ittycheriah and S. Roukos. 2007. Direct translation model 2. In Proceedings of HLT/NAACL, page 5764.
20. [Iyer and Bilmes2013] R. Iyer and J. Bilmes. 2013. Submodular optimization with submodular cover and submodular knapsack constraints. In Neural Information Processing Society (NIPS), Lake Tahoe, CA, December.
21. [Jegelka and Bilmes2011] Stefanie Jegelka and Jeff A. Bilmes. 2011. Submodularity beyond submodular energies: coupling edges in graph cuts. In Computer Vision and Pattern Recognition (CVPR), Colorado Springs, CO, June.
22. [Jurafsky and Martin2009] D. Jurafsky and J. H. Martin. 2009. Speech and Language Processing: An Introduction to Natural Language Processing, Speech Recognition, and Computational Linguistics. Prentice-Hall, 2nd edition.
23. [Koehn et al.2007] P. Koehn, H. Hoang, A. Birch, C. Callison-Burch, M. Federico, N. Bertoldi, B. Cowan, W. Shen, C. Moran, R. Zens, C. Dyer, O. Bojar, A. Constantin, and E. Herbst. 2007. Moses: Open source toolkit for statistical machine translation. In Proceedings of ACL.
24. [Koehn2004] P. Koehn. 2004. Statistical significance tests for machine translation evaluation. In Proceedings of EMNLP.
25. [Kolmogorov and Zabih2004] V. Kolmogorov and R. Zabih. 2004. What energy functions can be minimized via graph cuts? IEEE TPAMI, 26(2):147-159.
26. [Krause and Guestrin2011] A. Krause and C. Guestrin. 2011. Submodularity and its applications in optimized information gathering. ACM Transactions on Intelligent Systems and Technology, 2(4).
27. [Krause et al.2008] A. Krause, H.B. McMahan, C. Guestrin, and A. Gupta. 2008. Robust submodular observation selection. Journal of Machine Learning Research, 9:2761-2801.
28. [Leskovec et al.2007] J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 420-429.
29. [Lin and Bilmes2010] H. Lin and J. Bilmes. 2010. Multi-document summarization via budgeted maximization of submodular functions. In Proceedings of NAACL-HLT, pages 2761-2801.
30. [Lin and Bilmes2011] H. Lin and J. Bilmes. 2011. A class of submodular functions for document summarization. In Proceedings of ACL, pages 510-520.
31. [Lin and Bilmes2012] H. Lin and J. Bilmes. 2012. Learning mixtures of submodular shells with application to document summarization. In Uncertainty in Artifical Intelligence (UAI), Catalina Island, USA, July. AUAI.
32. [Lopez2007] A. Lopez. 2007. Hierarchical phrasebased translation with suffix arrays. In EMNLPCoNLL, pages 976-985.
33. [Lü et al.2007] Y. Lü, J. Huang, and Q. Liu. 2007. Improving statistical machine translation performance by training data selection and optimization. In Proceedings of EMNLP, pages 343-350.
34. [Mandal et al.2008] A. Mandal, D. Vergyri, W. Wang, J. Zheng, A. Stolcke, D. Hakkani-Tür G. Tür, and N.F. Ayan. 2008. Efficient data selection for machine translation. In Proceedings of the Spoken Language Technology Workshop, pages 261-264.
35. [Minoux1978] M. Minoux. 1978. Accelerated greedy algorithms for maximizing submodular functions. In Lecture Notes in Control and Information Sciences, volume 7, pages 234-243.
36. [Mirzasoleiman et al.2013] B. Mirzasoleiman, A. Karbasi, R. Sarkar, and A. Krause. 2013. Distributed submodular maximization: Identifying representative elements in massive data. In Neural Information Processing Systems (NIPS).
37. [Moore and Lewis2010] R. Moore and W. Lewis. 2010. Intelligent selection of language model training data. In Proceedings of the Association for Computational Linguistics, pages 220-224.
38. [Narasimhan and Bilmes2004] M. Narasimhan and J. Bilmes. 2004. PAC-learning bounded tree-width graphical models. In Uncertainty in Artificial Intelligence: Proceedings of the Twentieth Conference (UAI-2004). Morgan Kaufmann Publishers, July.
39. [Narayanan1997] H. Narayanan. 1997. Submodular functions and electrical networks. Elsevier.
40. [Nemhauser et al.1978] G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions i. Mathematical Programming, 14:265-294.
41. [Stobbe and Krause2010] P. Stobbe and A. Krause. 2010. Efficient minimization of decomposable submodular functions. In NIPS.
42. [Sviridenko2004] M. Sviridenko. 2004. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1):41-43.
43. [Turchi et al.2012a] M. Turchi, T. de Bie, C. Goutte, and N. Cristianini. 2012a. Learning to translate: A statistical and computational analysis. Advances in Artificial Intellligence, 2012:484580:15 pages.
44. [Turchi et al.2012b] M. Turchi, C. Goutte, and N. Cristianini. 2012b. Learning machine translation from in-domain and out-of-domain data. In Proceedings of EAMT, Trento, Italy.
45. [Wei et al.2013] K. Wei, Y. Liu, K. Kirchhoff, and J. Bilmes. 2013. Using document summarization techniques for speech data subset selection. In Proceedings of NAACL, pages 721-726, Atlanta, Georgia, June.
46. [Wei et al.2014] K. Wei, R. Iyer, and Jeff Bilmes. 2014. Fast multi-stage submodular maximization. In Proceedings of ICML, Beijing, China.