This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Use of Lexicon Density in Evaluating Word Recognizers
June 2002 (vol. 24 no. 6)
pp. 789-800

We have developed the notion of lexicon density as a metric to measure the expected accuracy of handwritten word recognizers. Thus far, researchers have used the size of the lexicon as a gauge for the difficulty of the handwritten word recognition task. For example, the literature mentions recognizers with accuracy for lexicons of sizes 10, 100, 1,000, and so forth, implying that the difficulty of the task increases (and, hence, recognition accuracy decreases) with increasing lexicon sizes across recognizers. Lexicon density is an alternate measure which is quite dependent on the recognizer. There are many applications such as addressinterpretation where such a recognizer dependent measure can be useful. We have conducted experiments with two different types of recognizers. A segmentation-based and a grapheme-based recognizer have been selected to show how the measure of lexicon density can be developed in general for any recognizer. Experimental results show that the lexicon density measure described is more suitable than lexicon size or a simple string edit distance.

[1] L.R. Bahl, F. Jelinek, and R.L. Mercer, “A Maximum Likelihood Approach to Continuous Speech Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 2, Mar. 1983.
[2] R.W. Hamming, Coding and Information Theory.Englewood Cliffs, N.J.: Prentice Hall, 1980.
[3] G. Kim and V. Govindaraju, “A Lexicon Driven Approach to Handwritten Word Recognition for Real Time Applications,“ IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 4, pp. 366-379, Apr. 1997.
[4] V.I. Levenshtein, “Binary Codes Capable of Correcting Insertions, Deletions, and Reversals,” Cybernetics and Control Theory, vol. 10, no. 8, pp. 707-710, 1966.
[5] G. Seni, V. Kripasundar, and R.K. Srihari, “Generalizing Edit Distance to Incorporate Domain Information: Handwritten Text Recognition as a Case Study,” Pattern Recognition, vol. 29, no. 3, pp. 405-414, 1996.
[6] G. Stepehen, String Searching Algorithms. World Scientific, 2000.
[7] R.A. Wagner and M.J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-78, 1974.
[8] H. Xue and V. Govindaraju, “Building Skeletal Graphs for Structural Feature Extraction on Handwriting Images,” Proc. Sixth Int'l Conf. Document Analysis and Recognition, Sept. 2001.

Index Terms:
Classifier combination, handwritten word recognizer, lexicon density, performance prediction, edit distances.
Citation:
Venu Govindaraju, Petr Slavík, Hanhong Xue, "Use of Lexicon Density in Evaluating Word Recognizers," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp. 789-800, June 2002, doi:10.1109/TPAMI.2002.1008385
Usage of this product signifies your acceptance of the Terms of Use.