Learning stochastic edit distance: Application in handwritten character recognition

Pattern Recognition

Volumn 39, Issue 9, 2006, Pages 1575-1587

  Oncina, Jose ^a   Sebban, Marc ^b  

^a UNIVERSITY OF ALICANTE   (Spain)

^b UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Finite state transducers; Handwritten character recognition; Stochastic edit distance

Indexed keywords

ALGORITHMS; COSTS; LEARNING SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; TRANSDUCERS;

CONDITIONAL TRANSDUCERS; FINITE-STATE TRANSDUCERS; HANDWRITTEN CHARACTER RECOGNITION; STOCHASTIC EDIT DISTANCE;

CHARACTER RECOGNITION;

EID: 33744981648     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.03.011     Document Type: Article

References (10)

1. Ristad E.S., and Yianilos P.N. Learning string-edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 20 5 (1998) 522-532
2. Sakakibara Y., and Siromoney R. A noise model on learning sets of strings. COLT '92: Proceedings of the Fifth Annual Workshop on Computational Learning Theory (1992) 295-302
3. E.S. Ristad, P.N. Yianilos, Finite growth models, Technical Report CS-TR-533-96, Princeton University Computer Science Department, 1996.
4. Casacuberta F. Probabilistic estimation of stochastic regular syntax-directed translation schemes. Proceedings of the Sixth Spanish Symposium on Pattern Recognition and Image Analysis (1995) 201-207
5. Clark A. Memory-based learning of morphology with stochastic transducers. Proceedings of the Annual Meeting of the Association for Computational Linguistic (2002)
6. Eisner J. Parameter estimation for probabilistic finite-state transducers. Proceedings of the Annual Meeting of the Association for Computational Linguistic (2002) 1-8
7. Gómez E., Micó L., and Oncina J. Testing the linear approximating eliminating search algorithm in handwritten character recognition tasks. Sixth Symposium Nacional de reconocimiento de Formas y Análisis de Imágenes (1995) 212-217
8. Micó L., and Oncina J. Comparison of fast nearest neighbour classifiers for handwritten character recognition. Pattern Recognition Lett. 19 (1998) 351-356
9. Rico-Juan J.R., and Micó L. Comparison of aesa and laesa search algorithms using string and tree-edit-distances. Pattern Recognition Lett. 24 (2003) 1417-1426
10. Dempster A., Laird M., and Rubin D. Maximum likelihood from incomplete data via the em algorithm. J. R. Stat. Soc. B 39 (1977) 1-38