Image analysis – Editing – error checking – or correction – Correcting alphanumeric recognition errors
Reexamination Certificate
2006-01-23
2010-02-16
Mehta, Bhavesh M (Department: 2624)
Image analysis
Editing, error checking, or correction
Correcting alphanumeric recognition errors
C382S231000
Reexamination Certificate
active
07664343
ABSTRACT:
Methods and systems of mapping of an optical character recognition (OCR) text string to a code included in a coding dictionary by supplementing the Levenshtein Distance Algorithm (LDA) with additional information in the form of adjustments based on particular character substitutions, insertions and deletions together with weighting based on multiple alternatives for the OCR text string. In one embodiment, an OCR text string mapping method (100) includes receiving (110) an OCR text string, comparing (120) it with selected text strings from a coding dictionary, computing (130) modified Levenshtein distances associated with the comparisons by determining (140) substitution penalties, determining (150) insertion penalties, determining (160) deletion penalties and combining (170) the penalties, selecting (180) the best matching text string from the coding dictionary based on the modified Levenshtein distances, determining (190) whether a maximum threshold distance is met, and assigning (200) a code associated with the best matching text string to the OCR text string when met, and assigning (210) a null or no code when not met.
REFERENCES:
patent: 5329598 (1994-07-01), Geist
patent: 5459739 (1995-10-01), Handley et al.
patent: 5519786 (1996-05-01), Courtney et al.
patent: 5805747 (1998-09-01), Bradford
patent: 5850480 (1998-12-01), Scanlon
patent: 6219453 (2001-04-01), Goldberg
patent: 6377945 (2002-04-01), Risvik
patent: 6885758 (2005-04-01), Bayer
patent: 7047493 (2006-05-01), Brill et al.
patent: 7092567 (2006-08-01), Ma et al.
patent: 7254774 (2007-08-01), Cucerzan et al.
patent: 7292975 (2007-11-01), Lovance et al.
patent: 2002/0021838 (2002-02-01), Richardson et al.
patent: 2003/0014448 (2003-01-01), Castellanos et al.
patent: 2004/0141354 (2004-07-01), Carnahan
patent: 2004/0210551 (2004-10-01), Jones et al.
patent: 2005/0123203 (2005-06-01), Heilper et al.
Dengel et al. (Dec. 1997) “Techniques for improving OCR results.” Chapter 8, Handbook of Character Recognition and Document Image Analysis, Bunke et al., Eds., pp. 227-258.
“ZIP code.” (Jan. 2005) Wikipedia.
Geist et al. (Jun. 1993) “The Second Census Optical Character Recognition Systems Conference: Call for Participation,” National Institute of Standards and Technology.
Search Report Under Section 17(5). UK Intellectual Property Office. Application No. GB0701002.8. Mailing Date May 17, 2007.
Levenshtein Distance. Wikipedia. http://web.archive.org/web/20060118071833/http://en.wikipedia.org/wiki/Levenshtein—distance. Jan. 18, 2006.
Kopchik Kurt P.
Oxman Oren I.
Withum Timothy O.
Drennan Barry
Lockheed Martin Corporation
Marsh & Fischmann & Breyfogle LLP
Mehta Bhavesh M
LandOfFree
Modified Levenshtein distance algorithm for coding does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Modified Levenshtein distance algorithm for coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Levenshtein distance algorithm for coding will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4196785