No such thing as a small change | |
PerlMonks |
Re: OCR matching regexby LanX (Saint) |
on Dec 19, 2016 at 11:48 UTC ( [id://1178057]=note: print w/replies, xml ) | Need Help?? |
These are fuzzy requirements My first guess is you are looking for Levenshtein_distance . My second guess is you have problems to phrase a clear heuristic and rather need a learning algorithm which can be trained with encountered problems. ° In any case we˛ need to see some real data in order to help.
Cheers Rolf
footnotes°) Something like calculating frequencies of false character sequences to calculate the probability of ambiguous solutions ˛) like all learning algorithms ;)
In Section
Seekers of Perl Wisdom
|
|