Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: measuring the similarity between strings

by dree (Monsignor)
on Sep 05, 2003 at 12:12 UTC ( #289186=note: print w/replies, xml ) Need Help??


in reply to measuring the similarity between strings

To make more efficient you can also try Text::LevenshteinXS that is 1000% faster than plain Text::Levenshtein.
  • Comment on Re: measuring the similarity between strings

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (4)
As of 2019-04-25 01:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I am most likely to install a new module from CPAN if:
















    Results (124 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!