Abstract
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie (automaton whose underlying graph is a tree). In a previous paper, we showed that non-deterministic automata were computationally more efficient than tries. In this paper, we propose a new method for constructing incrementally small non-deterministic automata from lexicons. We present experimental results demonstrating a significant reduction in the number of labels in the automata. This reduction yields a proportional speed-up in HMM based lexically constrained pattern recognition systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Appel, A.W., Jacobson, G.J.: The world’s fastest scrabble program. Communications of the ACM 31(5), 572–578, 585 (1988)
Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
Forney Jr, D.G.: The Viterbi Algorithm. Proceedings of the IEEE 61(3), 268–278 (1973)
Fredkin, E.: Trie Memory. Communications of the ACM 3(9), 490–499 (1960)
Garcia-Salicetti, S.: "Une approche neuronale prédictive pour la reconnaissance en-ligne de l’écriture cursive", Thèse de Doctorat Paris 6, Spécialité: Informatique, décembre 17 (1996)
Kosmala, A., Willett, D., Rigoll, G.: Advanced State Clustering for Very Large Vocabulary HMM-based On-Line Handwriting Recognition. In: ICDAR 1999, Bangalore, India, September 20-22, pp. 442–445 (1999)
Lacouture, R., De Mori, R.: Lexical Tree Compression. In: Eurospeech 1991, Genova, Italy, September 1991, pp. 581–584 (1991)
Lifchitz, A., Maire, F.: A Fast Lexically Constrained Viterbi Algorithm For Online Handwriting Recognition. In: Schomaker, L.R.B., Vuurpijl, L.G. (eds.) Proceedings of the Seventh International Workshop on Frontiers in Handwriting Recognition, September 11-13, pp. 313–322. International Unipen Foundation, Amsterdam (2000) ISBN 90-76942-01-3
Mohri, M., Riley, M.: Network optimizations for large-vocabulary speech recognition. Speech Communication 28, 1–12 (1999)
Ney, H.: Dynamic programming as a technique for pattern recognition. In: ICPR 1982, Munich, Germany, October 1982, pp. 1119–1125 (1982)
Rabiner, L.R., Juang, B.-H.: Fundamentals of Speech Recognition, pp. 321–389. Prentice Halls, Englewood Cliffs (1993)
Revuz, D.: Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science 92, 181–189 (1992)
Ristov, S., Laporte, E.: Ziv lempel compression of huge natural language data tries using suffix arrays. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 196–211. Springer, Heidelberg (1999)
Sgarbas, K.N., Fakotakis, N.D., Kokkinakis, G.K.: Incremental Construction of Compact Acyclic NFAs. In: Proceedings ACL-2001, 39th Annual Meeting of the Association for Computational Linguistics, Toulouse, France, July 6-11, pp. 474–481 (2001)
Vintsyuk, T.K.: Recognition of words in spoken speech by dynamicprogramming methods. Kibernetika 4(1), 81–88 (1968)
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory IT-13, 260–269 (1967)
Wimmer, Z.: Contribution à la lecture de documents papiers manuscrits: reconnaissance des champs numériques et cursifs par méthodes neuronales markoviennes, Thèse de Docteur-Ingénieur ENST de Paris, Spécialité: Informatique, septembre 28 (1998)
Wimmer, Z., Garcia-Salicetti, S., Lifchitz, A., Dorizzi, B., Gallinari, P., Artières, T.: REMUS (January 1999a), http://www-poleia.lip6.fr/CONNEX/HWR/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maire, F., Wathne, F., Lifchitz, A. (2003). Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-24581-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20646-0
Online ISBN: 978-3-540-24581-0
eBook Packages: Springer Book Archive