Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: OCR matching regex

by LanX (Saint)
on Dec 19, 2016 at 11:48 UTC ( [id://1178057]=note: print w/replies, xml ) Need Help??


in reply to OCR matching regex

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
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!

footnotes

°) Something like calculating frequencies of false character sequences to calculate the probability of ambiguous solutions

˛) like all learning algorithms ;)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1178057]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (2)
As of 2024-04-20 03:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found