The Tenjinno Machine Translation Competition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4201 LNAI, Issue , 2006, Pages 214-226

  Starkie, Bradford ^a   Van Zaanen, Menno ^b   Estival, Dominique ^c  

^a Starkie Enterprises Pty Ltd   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

^c Appen Pty Ltd   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; COMPUTER AIDED LANGUAGE TRANSLATION; DECISION THEORY; ERROR ANALYSIS; PROBLEM SOLVING;

BENCHMARK PROBLEMS; ERROR RATES; GRAMMATICAL INFERENCE; MACHINE TRANSLATION;

LEARNING SYSTEMS;

EID: 33750339717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11872436_18     Document Type: Conference Paper

References (13)

1. Kevin J. Lang, Barak A. Pearlmutter, and Rodney A. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In V. Honavar and G. Slutzki, editors, Proceedings of the Fourth International Conference on Grammar Inference, volume 1433 of Lecture Notes in AI, pages 1-12, Berlin Heidelberg, Germany, 1998. Springer-Verlag.
2. Bradford Starkie, François Coste, and Menno van Zaanen. The Omphalos context-free grammar learning competition. In Paliouras and Sakakibara [13], pages 16-27.
3. Bradford Starkie, François Coste, and Menno van Zaanen. Progressing the state-of-the-art in grammatical inference by competition. AI Communications, 18(2): 93-115, 2005.
4. National Institute of Standards and Technology. The 2006 nist machine translation evaluation plan (mt06), 2006. URL http://www.nist.gov/speech/tests/ mt/doc/mt06_evalplan.v4.pdf
5. F. Casacuberta. Inference of finite-state transducers by using regular grammars and morphisms. In Arlindo L. Oliveira, editor, Grammatical Inference: Algorithms and Applications (ICGI); Lisbon, Portugal, volume 1891 of Lecture Notes in AI, pages 1-14, Berlin Heidelberg, Germany, September 11-13 2000. Springer-Verlag.
6. E. Gurari. An Introduction to the Theory of Computation. Computer Science Press, Rockville:MD, USA, 1989.
7. A.V. Aho and J.D. Ullman. The theory of parsing, translation, and compiling. Prentice Hall, Englewood Cliffs:NJ, USA, 1972.
8. K.S. Fu. Syntactic pattern recognition and applications. Advances in computing science and technology series. Prentice Hall, Englewood Cliffs:NJ, USA, 1982.
9. L. G. Valiant. A theory of the learnable. Communications of the Association for Computing Machinery, 27(11):1134-1142, 1984.
10. J.C. Amengual, A. Castaño, A. Castellanos, V.M. Jiménez, D. Llorens, A. Marzal, F. Prat, J.M. Vilar, J.M. Benedi, F. Casacuberta, M. Pastor, and E. Vidal. The eutrans-i spoken language translation system. Machine Translation, 15(1):75-103, 2000.
11. E. Matusov, S. Kanthak, and H. Ney. Efficient statistical machine translation with constrained reordering. In European Association for Machine Translation (EAMT) 10th Annual Conference; Budapest, Hungary, pages 181-188, 2005.
12. E. Vidal and F. Casacuberta. Learning finite-state models for machine translation. In Paliouras and Sakakibara [13], pages 3-15.
13. Georgios Paliouras and Yasubumi Sakakibara, editors. Grammatical Inference: Algorithms and Applications: Seventh International Colloquium, (ICGI); Athens, Greece, volume 3264 of Lecture Notes in AI, Berlin Heidelberg, Germany, October 11-13 2004. Springer-Verlag.