Pushdown automata in statistical machine translation

Computational Linguistics

Volumn 40, Issue 3, 2014, Pages 687-723

  Allauzen, Cyril ^a   Byrne, Bill ^b,c   de Gispert, Adrià ^b,c   Iglesias, Gonzalo ^b,c   Riley, Michael ^a  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c SDL Research   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED LANGUAGE TRANSLATION; CONTEXT FREE GRAMMARS; DECODING; LINGUISTICS;

COMPLEXITY ANALYSIS; DECODING STRATEGY; EXPERIMENTAL CONDITIONS; HIERARCHICAL PHRASE; PUSHDOWN AUTOMATA; STATE-OF-THE-ART PERFORMANCE; STATISTICAL MACHINE TRANSLATION; SYNCHRONOUS CONTEXT-FREE GRAMMARS;

CONTEXT FREE LANGUAGES;

EID: 84910073639     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/COLI_a_00197     Document Type: Article

References (52)

1. Aho, Alfred V. and Jeffrey D. Ullman. 1972. The Theory of Parsing, Translation and Compiling, volume 1-2. Prentice-Hall
2. Allauzen, Cyril and Michael Riley, 2011. Pushdown Transducers. http://pdt.openfst.org.
3. Allauzen, Cyril, Michael Riley, and Johan Schalkwyk. 2011. Filters for efficient composition of weighted finite-state transducers. In Proceedings of CIAA, volume 6482 of LNCS, pages 28–38. Blois
4. Allauzen, Cyril, Michael Riley, Johan Schalkwyk, Wojciech Skut, and Mehryar Mohri. 2007. OpenFst: A general and efficient weighted finite-state transducer library. In Proceedings of CIAA, pages 11–23. http://www.openfst.org.
5. Bar-Hillel, Y, M. Perles, and E. Shamir. 1964. On formal properties of simple phrase structure grammars. In Y. Bar-Hillel, editor, Language and Information: Selected Essays on their Theory and Application. Addison-Wesley, pages 116–150.
6. Berstel, Jean. 1979. Transductions and Context-Free Languages. Teubner.
7. Blackwood, Graeme, Adriàde Gispert, and William Byrne. 2010. Efficient path counting transducers for minimum Bayes-risk decoding of statistical machine translation lattices. In Proceedings of the ACL: Short Papers, pages 27–32, Uppsala.
8. Brants, Thorsten, Ashok C. Popat, Peng Xu, Franz J. Och, and Jeffrey Dean. 2007. Large language models in machine translation. In Proceedings of EMNLP-ACL, pages 858–867, Prague.
9. Chang, Yin-Wen and Michael Collins. 2011. Exact decoding of phrase-based translation models through lagrangian relaxation. In Proceedings of EMNLP, pages 26–37, Edinburgh.
10. Chelba, Ciprian, Thorsten Brants, Will Neveitt, and Peng Xu. 2010. Study on interaction between entropy pruning and Kneser-Ney smoothing. In Proceedings of Interspeech, pages 2,242–2,245, Makuhari
11. Chiang, David. 2007. Hierarchical phrase-based translation. Computational Linguistics, 33(2):201–228.
12. de Gispert, Adrià, Gonzalo Iglesias, Graeme Blackwood, Eduardo R. Banga, and William Byrne. 2010. Hierarchical phrase-based translation with weighted finite state transducers and shallow-n grammars. Computational Linguistics, 36(3):201–228.
13. Deng, Yonggang and William Byrne. 2008. HMM word and phrase alignment for statistical machine translation. IEEE Transactions on Audio, Speech, and Language Processing, 16(3):494–507.
14. Dyer, Chris. 2010a. A Formal Model of Ambiguity and its Applications in Machine Translation. Ph.D. thesis, University of Maryland
15. Dyer, Chris. 2010b. Two monolingual parses are better than one (synchronous parse). In Proceedings of NAACL-HLT, pages 263–266, Los Angeles, CA.
16. Galley, M., M. Hopkins, K. Knight, and D. Marcu. 2004. What’s in a translation rule. In Proceedings of HLT-NAACL, pages 273–280, Boston, MA.
17. Hopkins, M. and G. Langmead. 2010. SCFG decoding without binarization. In Proceedings of EMNLP, pages 646–655, Cambridge,MA.
18. Huang, Liang. 2008. Advanced dynamic programming in semiring and hypergraph frameworks. In Proceedings of COLING, pages 1–18, Manchester.
19. Huang, Liang and David Chiang. 2007. Forest rescoring: Faster decoding with integrated language models. In Proceedings of ACL, pages 144–151, Prague.
20. Huang, Liang and Haitao Mi. 2010. Efficient incremental decoding for tree-to-string translation. In Proceedings of EMNLP, pages 273–283, Cambridge,MA.
21. Huang, Liang, Hao Zhang, and Daniel Gildea. 2005. Machine translation as lexicalized parsing with hooks. In Proceedings of the Ninth International Workshop on Parsing Technology, Parsing ’05, pages 65–73, Vancouver.
22. Iglesias, Gonzalo, Adrià de Gispert, Eduardo R. Banga, and William Byrne. 2009a. Hierarchical phrase-based translation with weighted finite state transducers. In Proceedings of NAACL-HLT, pages 433–441, Boulder, CO.
23. Iglesias, Gonzalo, Adrià de Gispert, Eduardo R. Banga, and William Byrne. 2009b. Rule filtering by pattern for efficient hierarchical translation. In Proceedings of EACL, pages 380–388, Athens.
24. Katz, Slava M. 1987. Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech, and Signal Processing, 35(3):400–401.
25. Kneser, Reinhard and Herman Ney. 1995. Improved backing-off for m-gram language modeling. In Proceedings of ICASSP, volume 1, pages 181–184, Detroit, MI.
26. Koo, Terry, Alexander M. Rush, Michael Collins, Tommi Jaakkola, and David Sontag. 2010. Dual decomposition for parsing with non-projective head automata. In Proceedings of EMNLP, pages 1,288–1,298, Cambridge,MA.
27. Kuich, Werner and Arto Salomaa. 1986. Semirings, automata, languages. Springer.
28. Kumar, Shankar and William Byrne. 2004. Minimum Bayes-risk decoding for statistical machine translation. In Proceedings of HLT-NAACL, pages 169–176, Boston, MA.
29. Kumar, Shankar and William Byrne. 2005. Local phrase reorderingmodels for statistical machine translation. In Proceedings of EMNLP-HLT, pages 161–168, Rochester, NY.
30. Kumar, Shankar, Yonggang Deng, and William Byrne. 2006. A weighted finite state transducer translation template model for statistical machine translation. Natural Language Engineering, 12(1):35–75.
31. Lang, Bernard. 1974. Deterministic techniques for efficient non-deterministic parsers. In Proceedings of ICALP, pages 255–269, Saarbr ücken.
32. Ljolje, Andrej, Fernando Pereira, and Michael Riley. 1999. Efficient general lattice generation and rescoring. In Proceedings of Eurospeech, pages 1,251–1,254, Budapest
33. Mohri, Mehryar. 2002. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics, 7:321–350.
34. Mohri, Mehryar. 2009. Weighted automata algorithms. In M. Drosde,W. Kuick, and H. Vogler, editors, Handbook of Weighted Automata. Springer, chapter 6, pages 213–254
35. Nederhof, Mark-Jan and Giorgio Satta. 2003. Probabilistic parsing as intersection. In Proceedings of 8th InternationalWorkshop on Parsing Technologies, pages 137–148, Nancy
36. Nederhof, Mark-Jan and Giorgio Satta. 2006. Probabilistic parsing strategies. Journal of the ACM, 53(3):406–436.
37. Och, Franz J. 2003. Minimum error rate training in statistical machine translation. In Proceedings of ACL, pages 160–167, Sapporo
38. Petre, Ion and Arto Salomaa. 2009. Algebraic systems and pushdown automata. In M. Drosde,W. Kuick, and H. Vogler, editors, Handbook of Weighted Automata. Springer, chapter 7, pages 257–289.
39. Prasad, R., K. Krstovski, F. Choi, S. Saleem, P. Natarajan, M. Decerbo, and D. Stallard. 2007. Real-time speech-to-speech translation for PDAs. In Proceedings of IEEE International Conference on Portable Information Devices, pages 1–5, Orlando, FL.
40. Roark, Brian, Cyril Allauzen, and Michael Riley. 2013. Smoothed marginal distribution constraints for language modeling. In Proceedings of ACL, pages 43–52, Sofia.
41. Roark, Brian, Richard Sproat, and Izhak Shafran. 2011. Lexicographic semirings for exact automata encoding of sequence models. In Proceedings of ACL-HLT, pages 1–5, Portland, OR.
42. Rush, Alexander M. and Michael Collins. 2011. Exact decoding of syntactic translation models through lagrangian relaxation. In Proceedings of ACL-HLT, pages 72–82, Portland, OR.
43. Satta, Giorgio and Enoch Peserico. 2005. Some computational complexity results for synchronous context-free grammars. In Proceedings of HLT-EMNLP, pages 803–810, Vancouver.
44. Shafran, Izhak, Richard Sproat, Mahsa Yarmohammadi, and Brian Roark. 2011. Efficient determinization of tagged word lattices using categorical and lexicographic semirings. In Proceedings of ASRU, pages 283–288, Honolulu, HI.
45. Stolcke, Andreas. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165–201.
46. Stolcke, Andreas. 1998. Entropy-based pruning of backoff language models. In Proceedings of DARPA Broadcast News Transcription and Understanding Workshop, pages 270–274, Landsdowne, VA.
47. Tromble, Roy, Shankar Kumar, Franz J. Och, and Wolfgang Macherey. 2008. Lattice minimum Bayes-risk decoding for statistical machine translation. In Proceedings of EMNLP, pages 620–629, Edinburgh.
48. Wu, Dekai. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23:377–403.
49. Xiao, Tong, Mu Li, Dongdong Zhang, Jingbo Zhu, and Ming Zhou. 2009. Better synchronous binarization for machine translation. In Proceedings of EMNLP, pages 362–370, Singapore.
50. Zens, Richard and Hermann Ney. 2008. Improvements in dynamic programming beam search for phrase-based statistical machine translation. In Proceedings of IWSLT, pages 195–205, Honolulu, HI.
51. Zhang, Hao, Liang Huang, Daniel Gildea, and Kevin Knight. 2006. Synchronous binarization for machine translation. In Proceedings of HLT-NAACL, pages 256–263, New York, NY.
52. Zollmann, Andreas and Ashish Venugopal. 2006. Syntax augmented machine translation via chart parsing. In Proceedings of NAACL Workshop on Statistical Machine Translation, pages 138–141, New York, NY.