Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
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 lurking in the Monastery: (14)
As of 2014-07-31 18:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (250 votes), past polls