Академический Документы
Профессиональный Документы
Культура Документы
Tanushyam Chattopadhyay
I.
model;
INTRODUCTION
599
A. Score-based approach
Segmentation graph shows us all possible choices of
word i.e. a sequence of recognized characters with some
score or confidence. The path having the best score or
confidence measure is selected as the best alternative. The
score of a path is calculated as follows. Each recognized
character in each choice holds some score; these scores are
then added and divided by the number of characters along
the path to get an average score for the path (or word). So
each word choice has some score, maximum score help us to
decide the most likely word. Note that this method does not
use any language model at all rather it relies only on the
character classifier. We treat such a framework a basesystem which can be used for an open-vocabulary
environment but it doesnt use any post-processing.
II.
LANGUAGE MODELS
B. Trie-based approach
This is one of the lexicon based approach where the
lexicon is stored in trie data structure. Figure 4 shows an
example trie of four words {e, e, , } including the
600
III.
EXPERIMENTS
# Correctly
recognized
words
(%)
Correct
Score-based
(No Language Model)
5,144
73.28
5,732
81.65
6,528
92.99
601
[9]
[10]
[11]
[12]
CONCLUSIONS
[13]
[14]
[15]
[16]
[17]
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
602