Abstract
We describe several approaches for the application of hidden Markov models to the recognition of handwritten words. In all approaches the words are described by strings of symbols. The descriptions differ only with respect to the size of the vocabulary to be recognized. We can define two distinct cases: in the first, the vocabulary is small and constant; in the second, the vocabulary is limited, but dynamic in the sense that it is a varying subset of an open one. We also describe an application of hidden Markov models to the representation of contextual knowledge and propose some strategies for rejecting unreliable word interpretations, in particular, when the word corresponding to the image does not necessarily belong to the lexicon.
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.
