Training tree transducers

Computational Linguistics

Volumn 34, Issue 3, 2008, Pages 391-427

  Graehl, Jonathan ^a,b   Knight, Kevin ^a,b   May, Jonathan ^a,b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

FINITE STATE; HIERARCHICAL TREE; NATURAL LANGUAGES; PROBABILISTIC MODELS; PROBABILISTIC TREES; STANDARD TOOLS; TREE TRANSDUCERS; TREE-BASED MODEL;

TRANSDUCERS;

EID: 50849120023     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/coli.2008.07-051-R2-03-57     Document Type: Article

References (46)

1. Aho, A. V. and J. D. Ullman. 1971. Translations of a context-free grammar. Information and Control, 19:439-475.
2. Alshawi, Hiyan, Srinivas Bangalore, and Shona Douglas. 2000. Learning dependency translation models as collections of finite state head transducers. Computational Linguistics, 26(1):45-60.
3. Baker, J. K. 1979. Trainable grammars for speech recognition. In Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, pages 547-550, Boston, MA.
4. Bangalore, Srinivas and Owen Rambow. 2000. Exploiting a probabilistic hierarchical model for generation. In International Conference on Computational Linguistics (COLING 2000), pages 42-48, Saarbrucken, Germany.
5. Bangalore, Srinivas and Giuseppe Riccardi. 2002. Stochastic finite-state models for spoken language machine translation. Machine Translation, 17(3):165-184.
6. Baum, L. E. and J. A. Eagon. 1967. An inequality with application to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematicians Society, 73:360-363.
7. Charniak, Eugene. 2001. Immediate-head parsing for language models. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 116-123, Tolouse, France.
8. Chelba, C. and F. Jelinek. 2000. Structured language modeling. Computer Speech and Language, 14(4):283-332.
9. Collins, Michael. 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the ACL (jointly with the 8th Conference of the EACL), pages 16-23, Madrid, Spain.
10. Comon, H., M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. 1997. Tree automata techniques and applications. Available at http://www.grappa.univ-lille3.fr/tata. Release of 12 October 2007.
11. Corston-Oliver, Simon, Michael Gamon, Eric K. Ringger, and Robert Moore. 2002. An overview of Amalgam: A machine-learned generation module. In Proceedings of the International Natural Language Generation Conference, pages 33-40, New York.
12. Dempster, A. P., N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38.
13. Doner, J. 1970. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406-451.
14. Eisner, Jason. 2002. Parameter estimation for probabilistic finite-state transducers. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), pages 1-8, Philadelphia, PA.
15. Eisner, Jason. 2003. Learning non-isomorphic tree mappings for machine translation. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (companion volume), pages 205-208, Sapporo, Japan.
16. Engelfriet, Joost. 1975. Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory, 9(3):198-231.
17. Engelfriet, Joost. 1977. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory, 10:289-303.
18. Engelfriet, Joost, Zoltán Fülöp, and Heiko Vogler. 2004. Bottom-up and top-down tree series transformations. Journal of Automata, Languages and Combinatorics, 7(1):11-70.
19. Fülöp, Zoltán and Heiko Vogler. 2004. Weighted tree transducers. Journal of Automata, Languages and Combinatorics, 9(1):31-54.
20. Gécseg, Ferenc and Magnus Steinby. 1984. Tree Automata. Akadémiai Kiadó, Budapest.
21. Gildea, Daniel. 2003. Loosely tree-based alignment for machine translation. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 80-87, Sapporo, Japan.
22. Graehl, Jonathan. 1997. Carmel finite-state toolkit. Available at http://www.isi.edu/licensed-sw/carmel/.
23. Graehl, Jonathan and Kevin Knight. 2004. Training tree transducers. In HLT-NAACL 2004: Main Proceedings, pages 105-112, Boston, MA.
24. Hoperoft, John and Jeffrey Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, London.
25. Joshi, Aravind and Yves Schabes. 1997. Tree-adjoining grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer, Berlin, pages 69-124.
26. Klein, Dan and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 423-430, Sapporo, Japan.
27. Knight, Kevin and Yaser Al-Onaizan. 1998. Translation with finite-state devices. In Proceedings of the 3rd Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup (AMTA-98), pages 421-437, Berlin.
28. Knight, Kevin and Daniel Marcu. 2002. Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence, 139(1):91-107.
29. Koehn, Phillip, Franz Och, and Daniel Marcu. 2003. Statistical phrase-based translation. In HLT-NAACL 2003: Main Proceedings, pages 127-133, Edmonton, Alberta, Canada.
30. Kuich, Werner. 1999. Tree transducers and formal tree series. Acta Cybernetica, 14:135-149.
31. Kumar, Shankar and William Byrne. 2003. A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In HLT-NAACL 2003: Main Proceedings, pages 142-149, Edmonton, Alberta, Canada.
32. Langkilde, Irene. 2000. Forest-based statistical sentence generation. In Proceedings of the 6th Applied Natural Language Processing Conference, pages 170-177, Seattle, WA.
33. Langkilde, Irene and Kevin Knight. 1998. Generation that exploits corpus-based statistical knowledge. In Proceedings of the Conference of the Association for Computational Linguistics (COLING/ACL), pages 704-710, Montreal, Canada.
34. Lari, K. and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4(1):35-56.
35. Marcu, Daniel and William Wong. 2002. A phrase-based, joint probability model for statistical machine translation. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 133-139, Philadelphia, PA.
36. May, Jonathan and Kevin Knight. 2006. Tiburon: A weighted tree automata toolkit. Implementation and Application of Automata: 10th International Conference, CIAA 2005, volume 4094 of Lecture Notes in Computer Science, pages 102-113, Taipei, Taiwan.
37. Nederhof, Mark-Jan and Giorgio Satta. 2002. Parsing non-recursive CFGs. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), pages 112-119, Philadelphia, PA.
38. Och, Franz, Christoph Tillmann, and Hermann Ney. 1999. Improved alignment models for statistical machine translation. In Proceedings of the Joint Conference of Empirical Methods in Natural Language Processing and Very Large Corpora, pages 20-28, College Park, MD.
39. Pang, Bo, Kevin Knight, and Daniel Marcu. 2003. Syntax-based alignment of multiple translations extracting paraphrases and generating new sentences. In HLT-NAACL 2003: Main Proceedings, pages 181-188, Edmonton, Alberta, Canada.
40. Rounds, William C. 1970. Mappings and grammars on trees. Mathematical Systems Theory, 4(3):257-287.
41. Schabes, Yves. 1990. Mathematical and Computational Aspects of Lexicalized Grammars. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
42. 2 sequential machine maps. Journal of Computer and System Sciences, 4:339-367.
43. Viterbi, Andrew. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13:260-269.
44. Wu, Dekai. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377-404.
45. Yamada, Kenji and Kevin Knight. 2001. A syntax-based statistical translation model. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 523-530, Tolouse, France.
46. Yamada, Kenji and Kevin Knight. 2002. A decoder for syntax-based statistical MT. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), pages 303-310, Philadelphia, PA.