Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1

  • Alexander Clark
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4201)


We discuss the problem of large scale grammatical inference in the context of the Tenjinno competition, with reference to the inference of deterministic finite state transducers, and discuss the design of the algorithms and the design and implementation of the program that solved the first problem. Though the OSTIA algorithm has good asymptotic guarantees for this class of problems, the amount of data required is prohibitive. We therefore developed a new strategy for inferring large scale transducers that is more adapted for large random instances of the type in question, which involved combining traditional state merging algorithms for inference of finite state automata with EM based alignment algorithms and state splitting algorithms.


Machine Translation Expectation Maximisation Algorithm Input String State Automaton Input Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abe, N., Warmuth, M.K.: On the computational complexity of approximating distributions by probabilistic automata. Machine Learning 9, 205–260 (1992)MATHGoogle Scholar
  2. 2.
    Baum, L.E., Petrie, T.: Statistical inference for probabilistic functions of finite state markov chains. Annals of Mathematical Statistics 37, 1559–1663 (1966)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol. 862, pp. 139–152. Springer, Heidelberg (1994)Google Scholar
  4. 4.
    Clark, A.: Memory-based learning of morphology with stochastic transducers. In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 513–520 (2002)Google Scholar
  5. 5.
    Clark, A.: Learning deterministic context free grammars in the Omphalos competition. Machine Learning (to appear, 2006)Google Scholar
  6. 6.
    Clark, A., Thollard, F.: Partially distribution-free learning of regular languages from positive samples. In: Proceedings of COLING, Geneva, Switzerland (2004)Google Scholar
  7. 7.
    Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B 39, 1–38 (1977)MATHMathSciNetGoogle Scholar
  8. 8.
    Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of proteins and nucleic acids. Cambridge University Press, Cambridge (1998)MATHCrossRefGoogle Scholar
  9. 9.
    Emele, M.C.: Unification with lazy non-redundant copying. In: Meeting of the Association for Computational Linguistics, pp. 323–330 (1991)Google Scholar
  10. 10.
    Casacuberta, F.: Probabilistic estimation of stochastic regular syntax-directed translation schemes. In: Moreno, R. (ed.) VI Spanish Symposium on Pattern Recognition and Image Analysis, pp. 201–297. AERFAI (1995)Google Scholar
  11. 11.
    Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)MATHCrossRefGoogle Scholar
  12. 12.
    Oncina, J., García, P., Vidal, E.: Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 448–458 (1993)CrossRefGoogle Scholar
  13. 13.
    Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Starkie, B., van Zaanen, M., Estival, D.: Tenjinno machine translation competition (2006),
  15. 15.
    Vilar, J.M.: Improve the learning of subsequential transducers by using alignments and dictionaries. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol. 1891, pp. 298–311. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Wu, D.: Stochastic inversion transduction grammars, with application to segmentation, bracketing, and alignment of parallel corpora. In: IJCAI 1995, Montreal, pp. 1328–1335 (August 1995)Google Scholar
  17. 17.
    Zhang, H., Gildea, D.: Stochastic lexicalized inversion transduction grammar for alignment. In: Proceedings of the 43rd Annual Conference of the Association for Computational Linguistics (ACL 2005) (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexander Clark
    • 1
  1. 1.Department of Computer ScienceUniversity of LondonEgham, Surrey

Personalised recommendations