Home/ Questions/Q 6138265
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-23T17:51:05+00:00

After running optical char recognition on some images, I get approximate text. Often the

  • 0

After running optical char recognition on some images, I get approximate text. Often the recognition is not great. For instance, the actual text “DATE” comes as “DHTE” or “0HTE”. Basically I need to identify and extract the data in each line, so i don’t want perfect recognition, just enough to identify the date line. I tried to calculate the Levenshtein edit distance, but unfortunately this tends to give similar values for DATE and TIME. At the moment, I’m trying to explore if I can match the data patterns using regular expressions instead.

Is there a method/algorithm to better the matching process? Fortunately, my set of words is not very large.

(i’m using tesseract for ocr and groovy/java for the algorithm)

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This one has a few pretty cool algorithms
    http://secondstring.sourceforge.net/

    This is a basic one in StringUtils
    levenstein distance

    • 0