On the learnability and usage of acyclic probabilistic finite automata

Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995

Volumn 1995-January, Issue , 1995, Pages 31-40

  Ron, Dana ^a   Singer, Yoram ^a   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION; FINITE AUTOMATA; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS;

DISTINGUISHABILITY; HANDWRITING RECOGNITION; HARDNESS RESULT; HIGH CONFIDENCE; LOG LIKELIHOOD; POLYNOMIAL-TIME; PROBABILISTIC FINITE AUTOMATA; PROBABILISTIC MODELS;

LEARNING ALGORITHMS;

EID: 84954410847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/225298.225302     Document Type: Conference Paper

References (21)

1. N. Abe and M. Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205-260, 1992
2. L. E. Baum and T. Peine. Statistical inference for probabilistic functions of finite state markov chains. Annals of Mathematical Statistics, 37, 1966.
3. Y. Bengio, Y. le Cun, and D. Henderson. Globally trained handwritten word recognizer using spatial representation, convolutional neural networks, and hidden Markov models. In Advances in Neural Information Processing Systems, volume 6. Morgan Kaufmann, 1993.
4. R. C. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In The 2nd Intl Collo. on Grammatical Inference and Applications, pages 139-152, 1994.
5. F. R. Chen. Identification of contextual factos for pronounciation networks. In Proc. of IEEE Conf on Acoustics, Speech and Signal Processing, pages 753-756. 1990
6. Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie. Efficient learning of typical finite automata from random walks In Proceedings of the 24 th Annual ACM Symp. on Theory of Computing, pages 315-324. 1993
7. M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie. On the learnability of discrete distributions. In The 25th Annual ACM Symp. on Theory of Computing, 1994.
8. N. Merhav and Y. Ephraim. Maximum likelihood hidden Markov modeling using a dominant sequence of states IEEE Trans. on ASSP, 39 (9). 2111-2115, 1991.
9. R. Plamondon and C. G. Leedham, editors. Computer Processing of Handwriting. World Scientific. 1990.
10. R. Plamondon. C. Y. Suen, and M. L. Simner, editors. Computer Recognition and Human Production of Handwriting. World Scientific, 1989.
11. L. R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proc. of the IEEE, 1989.
12. L. R. Rabiner and B. H. Juang. An introduction to hidden markov models. IEEE ASSP Magazine, 3(1):4-16, 1986.
13. M. D. Riley. A statistical model for generating pronounication networks. In Proc. of IEEE Conf on Acoustics, Speech and Signal Processing, pages 131-140, 1991.
14. D. Ron, Y. Singer, and N. Tishby. Learning probabilistic automata with variable memory length. In Proceedings of the Seventh Annual Workshop on Computational Learning Theory. 1994. (To appear in Machine Learning).
15. D. Ron. Y Singer, and T. Tishby. On the learnability and usage of acyclic probabilistic finite automata. Technical Report CS-TR-23, Hebrew University, 1995.
16. D. Sankoff and J. B. Kruskal. Time warps, string edits and macromolecules. the theory and practice of sequence comparison. Addison-Wesley, Reading Mass, 1983.
17. Y Singer and N. Tishby. Dynamical encoding of cursive handwriting. Biological Cybernetics, 71(3):227-237, 1994.
18. Y. Singer and N Tishby. An adaptive cursive handwriting recognition system. Technical Report CS-TR-22, Hebrew University, 1995.
19. A. Stolcke and S. Omohundro. Hidden Markov model induction by Bayesian model merging. In Advances in Neural Information Processing Systems, volume 5. Morgan Kaufmann, 1992
20. C. C. Tappert, C. Y. Suen, and T. Wakahara. The state of art in on-line handwriting recognition. IEEE Trans, on Pat. Anal. and Mach Int., 12(8):787-808. 1990.
21. B A. Trakhtenbrot and Ya. M. Brazdin Finite Automata: Behavior and Synthesis. North-Holland. 1973.