By Topic

Experiments in Text Recognition with the Modified Viterbi Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Rajjan Shinghal ; MEMBER, IEEE, Department of Computer Science, Concordia University, Montreal, P.Q., Canada. ; Godfried T. Toussaint

In this paper a modification of the Viterbi algorithm is formally described, and a measure of its complexity is derived. The modified algorithm uses aheuristic to limit the search through a directed graph or trellis. The effectiveness of the algorithm is investigated via exhaustive experimentation on an input of machine-printed text. The algorithm assumes language to be a Markov chain and uses transition probabilities between characters. The results empirically answer the long-standing question of what is the benefit, if any, of using transition probabilities that depend on the length of a word and their position in it.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-1 ,  Issue: 2 )