In this paper a recognition system, based on tied-mixture hidden Markov models, for handwritten address words is described, which makes use of a language model that consists of backoff character n-grams. For a dictionary-based recognition system it is essential that the structure of the address (name, street, city) is known. If the single parts of the address cannot be categorized, the used vocabulary is unknown and thus unlimited. The performance of this open vocabulary recognition using n-grams is compared to the use of dictionaries of different sizes. Especially, the confidence of recognition results and the possibility of a useful post-processing are significant advantages of language models.
Handwritten address recognition with open vocabulary using character n-grams
2002-01-01
312914 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Handwritten Address Recognition with Open Vocabulary Using Character N-Grams
British Library Conference Proceedings | 2002
|Offline Recognition of Large Vocabulary Cursive Handwritten Text
British Library Conference Proceedings | 2003
|Using Normal Patterns in Handwritten Character Recognition
British Library Conference Proceedings | 1999
|Handwritten Hangul Character Recognition with Hierarchical Stochastic Character Representation
British Library Conference Proceedings | 2003
|