30 March 1995 Generalizing edit distance for handwritten text recognition
Author Affiliations +
Abstract
In this paper the Damerau-Levenshtein string difference metric is generalized in two ways to more accurately compensate for the types of errors that are present in the script recognition domain. First, the basic dynamic programming method for computing such a measure is extended to allow for merges, splits and two-letter substitutions. Second, edit operations are refined into categories according to the effect they have on the visual `appearance' of words. A set of recognizer-independent constraints is developed to reflect the severity of the information lost due to each operation. These constraints are solved to assign specific costs to the operations. Experimental results on 2,335 corrupted strings and a lexicon of 21,299 words show higher correcting rates than with the original form.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Giovanni Seni, V. Kripasundar, Rohini K. Srihari, "Generalizing edit distance for handwritten text recognition", Proc. SPIE 2422, Document Recognition II, (30 March 1995); doi: 10.1117/12.205841; https://doi.org/10.1117/12.205841
PROCEEDINGS
12 PAGES


SHARE
KEYWORDS
Error analysis

Lithium

Picosecond phenomena

Computer programming

Visualization

Optical character recognition

Statistical analysis

RELATED CONTENT


Back to Top