Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Comparing likeness of two strings

by VSarkiss (Monsignor)
on Jan 19, 2005 at 20:24 UTC ( #423492=note: print w/replies, xml ) Need Help??


in reply to Comparing likeness of two strings

The String::Approx module uses Levenshtein distance for its matching. According to the docs, the latest version is "2-3 times faster" than the previous one. Give it a try.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://423492]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2018-07-23 00:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?















    Results (458 votes). Check out past polls.

    Notices?