RULE BASED CONTEXTUAL POST-PROCESSING FOR DEVANAGARI TEXT RECOGNITION

The spatial relationships among the constituent symbols of Devanagari script play an important role in the interpretation of Devanagari words. There are a number of constraints on these spatial relationships which characterise Devanagari script composition syntax. When the word composition is not found to be syntactically correct, the symbols are substituted with their resembling counterparts. The symbol substitution rules are mostly heuristic in nature. Human interpretation normally involves application of script composition syntax rules and the symbol substitution rules in an interleaved fashion. This paper presents a design of a post-processor which corrects the Devangagari symbol string based on this observation. The composition syntax checker is represented in the form of a finite state machine. The substitution rules are in the form of condition action pairs giving flexibility to the system for easy alteration. Each substitution rule has a penalty associated with it and the accumulated penalty value for a word gives a measure of its confidence level.