Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Match Algorithm: How close of a match

by Fletch (Bishop)
on Aug 17, 2010 at 15:43 UTC ( #855531=note: print w/replies, xml ) Need Help??


in reply to Match Algorithm: How close of a match

String::Approx? If that's not what you want the google fodder "Levenshtein distance" is probably a good starting point.

The cake is a lie.
The cake is a lie.
The cake is a lie.

  • Comment on Re: Match Algorithm: How close of a match

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2022-12-02 12:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?