Abstract
Viewing a handwritten word as an alternating sequence of characters and ligatures, we proposed a circularly interconnected network of hidden Markov models to model handwritten English words of indefinite length. The recognition problem is then regarded as finding the most probable path in the network for a given input. For the search, Viterbi algorithm is applied with lexicon lookup. To overcome directional sensitivity of the path search, a back-tracking technique is employed that keeps plausible path candidates dynamically within limited storage space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
