Use of Lexicon Density in Evaluating Word Recognizers

We have developed the notion of lexicon density as the true metric to measure expected recognizer accuracy. This metric has a variety of applications, among them evaluation of recognition results, static or dynamic recognizer selection, or dynamic combination of recognizers. We show that the performance of word recognizers increases as lexicon density decreases and that the relationship between the performance and lexicon density is independent of lexicon size. Our claims are supported by extensive experimental validation data.

[1]  Gyeonghwan Kim,et al.  Bankcheck Recognition Using Cross Validation Between Legal and Courtesy Amounts , 1997, Int. J. Pattern Recognit. Artif. Intell..

[2]  Lalit R. Bahl,et al.  A Maximum Likelihood Approach to Continuous Speech Recognition , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Gyeonghwan Kim,et al.  A Lexicon Driven Approach to Handwritten Word Recognition for Real-Time Applications , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.