This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Offline Grammar-Based Recognition of Handwritten Sentences
May 2006 (vol. 28 no. 5)
pp. 818-821
This paper proposes a sequential coupling of a Hidden Markov Model (HMM) recognizer for offline handwritten English sentences with a probabilistic bottom-up chart parser using Stochastic Context-Free Grammars (SCFG) extracted from a text corpus. Based on extensive experiments, we conclude that syntax analysis helps to improve recognition rates significantly.

[1] J.-C. Chappelier and M. Rajman, “A Generalized CYK Algorithm for Parsing Stochastic CFG,” Actes de TAPD, pp. 133-137, 1998.
[2] J.-C. Chappelier, M. Rajman, R. Aragüés, and A. Rozenknop, “Lattice Parsing for Speech Recognition,” Proc. Sixth Conf. sur le Traitement Automatic du Langage Naturel, pp. 95-104, 1999.
[3] C. Chelba and F. Jelinek, “Structured Language Modeling,” Computer Speech and Language, vol. 14, pp. 283-332, 2000.
[4] C. Crowner and J. Hull, “A Hierarchical Pattern Matching Parser and Its Application to Word Shape Recognition,” Proc. First Int'l Conf. Document Analysis and Recognition, vol. 1, pp. 323-331, 1991.
[5] G. Erbach, “Bottom-Up Earley Deduction,” Proc. 14th Int'l Conf. Computational Linguistics, 1994.
[6] J. García-Hernandez, J.-A. Sánchez, and J.-M. Benedí, “Performance and Improvements of a Language Model Based on Stochastic Context-Free Grammars,” Proc. 11th Iberian Conf. Pattern Recognition and Image Analysis, pp. 271-278, 2003.
[7] R. Garside, G. Leech, and T. Váradi, Manual of Information for the Lancaster Parsed Corpus. Bergen, Norway: Norwegian Computing Center for the Humanities, 1995.
[8] I. Good, “The Population Frequencies of Species and the Estimation of Population Parameters,” Biometrika, vol. 40, pp. 237-264, 1953.
[9] N. Gorski, V. Anisimov, E. Augustin, D. Price, and J.-C. Simon, “A2iA Check Reader: A Family of Bank Check Recognition Systems,” Proc. Fifth Int'l Conf. Document Analysis and Recognition, pp. 523-526, 1999.
[10] S.L. Graham, M.A. Harrison, and W.L. Ruzzo, “An Improved Context-Free Recognizer,” ACM Trans. Programming Languages and Systems, vol. 2, no. 3, pp. 415-462, 1980.
[11] T. Hong and J. Hull, “Text Recognition Enhancement with a Probabilistic Lattice Chart Parser,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 222-225, 1993.
[12] J. Hull, “Incorporating Language Syntax in Visual Text Recognition with Statistical Model,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 12, pp. 1251-1256, Dec. 1996.
[13] S. Johansson, E. Atwell, R. Garside, and G. Leech, The Tagged LOB Corpus, Users's Manual. Bergen, Norway: Norwegian Computing Center for the Humanities, 1986.
[14] S. Johansson, G. Leech, and H. Goodluck, “Manual of Information to Accompany the Lancaster-Oslo/Bergen Corpus of British English, for Use with Digital Computers,” Dept. of English, Univ. of Oslo, Norway, 1978.
[15] D. Jurafsky, C. Wooters, J. Segal, A. Stolcke, E. Fosler, G. Tajchman, and N. Morgan, “Using a Stochastic Context-Free Grammar as a Language Model for Speech Recognition,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 189-192, 1995.
[16] S. Katz, “Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 35, no. 3, pp. 400-401, 1987.
[17] F. Keenan, L. Evett, and R. Whitrow, “A Large Vocabulary Stochastic Syntax Analyser for Handwriting Recognition,” Proc. First Int'l Conf. Document Analysis and Recognition, pp. 794-802, 1991.
[18] K. Kita, T. Kawabata, and H. Saito, “HMM Continuous Speech Recognition Using Predictive LR Parsing,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 703-706, 1989.
[19] K. Kita and W. Ward, “Incorporating LR Parsing into SPHINX,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 269-272, 1991.
[20] A.L. Koerich, Y. Leydier, R. Sabourin, and C.Y. Suen, “A Hybrid Large Vocabulary Handwritten Word Recognition System Using Neural Networks and Hidden Markov Models,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, pp. 99-104, 2002.
[21] U. Mahadevan and S.N. Srihari, “Parsing and Recognition of City, State, and Zipcodes in Handwritten Addresses,” Proc. Fifth Int'l Conf. Document Analysis and Recognition, pp. 325-328, 1999.
[22] U.-V. Marti and H. Bunke, “Using a Statistical Language Model to Improve the Performance of an HMM-Based Cursive Handwriting Recognition System,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 15, pp. 65-90, 2001.
[23] U.-V. Marti and H. Bunke, “The IAM-Database: An English Sentence Database for Off-Line Handwriting Recognition,” Int'l J. Document Analysis and Recognition, vol. 5, pp. 39-46, 2002.
[24] A. Ogawa, K. Takeda, and F. Itakura, “Balancing Acoustic and Linguistic Probabilities,” Proc. IEEE Conf. Acoustics, Speech, and Signal Processing, pp. 181-184, 1998.
[25] P.Y. Simard, D. Steinkraus, and J. Platt, “Best Practices for Convolutional Nerual Networks Applied to Visual Document Analysis,” Proc. Seventh Int'l Conf. Document Analysis and Recognition, vol. 2, pp. 958-962, 2003.
[26] L. Rabiner and B.-H. Juang, Fundamentals of Speech Recognition. Prentice Hall, 1993.
[27] B. Roark, “Probabilistic Top-Down Parsing and Language Modeling,” Computational Linguistics, vol. 27, no. 2, pp. 249-276, 2001.
[28] R. Srihari, S. Ng, C. Baltus, and J. Kud, “Use of Language Models in On-Line Sentence/Phrase Recognition,” Proc. Third Int'l Workshop Frontiers in Handwriting Recognition, pp. 284-294, 1993.
[29] S. Uchida and H. Sakoe, “An Off-Line Character Recognition Method Employing Model-Dependent Pattern Normalization by an Elastic Membrane Model,” Proc. Fifth Int'l Conf. Document Analysis and Recognition, pp. 499-502, 1999.
[30] A. Vinciarelli, S. Bengio, and H. Bunke, “Offline Recognition of Unconstrained Handwritten Texts Using HMM and Statistical Language Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 6, pp. 709-720, June 2004.
[31] A. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans. Information Theory, vol. 13, no. 2, pp. 260-269, 1967.
[32] F. Voisin and J. Raoult, “A New, Bottom-Up, General Parsing Algorithm,” Journées AFCET-GROPLAN, les Avancées en Programmation, 1990.
[33] M. Zimmermann and H. Bunke, “Automatic Segmentation of the IAM Off-Line Handwritten English Text Database,” Proc. 16th Int'l Conf. Pattern Recognition, vol. 4, pp. 35-39, 2002.
[34] M. Zimmermann and H. Bunke, “Hidden Markov Model Length Optimization for Handwriting Recognition Systems,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, pp. 369-374, 2002.
[35] M. Zimmermann and H. Bunke, “Optimizing the Integration of Statistical Language Models in HMM Based Offline Handwritten Text Recognition,” Proc. 17th Int'l Conf. Pattern Recognition, vol. 2, pp. 541-544, 2004.
[36] M. Zimmermann, J.-C. Chappelier, and H. Bunke, “Parsing n-best Lists of Handwritten Sentences,” Proc. Seventh Int'l Conf. Document Analysis and Recognition, vol. 1, pp. 572-576, 2003.

Index Terms:
Optical character recognition, handwriting analysis, natural language parsing and understanding.
Citation:
Matthias Zimmermann, Jean-C?dric Chappelier, Horst Bunke, "Offline Grammar-Based Recognition of Handwritten Sentences," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 5, pp. 818-821, May 2006, doi:10.1109/TPAMI.2006.103
Usage of this product signifies your acceptance of the Terms of Use.