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

Re^4: Levenshtein distance: calculating similarity of strings

by AnomalousMonk (Archbishop)
on Feb 22, 2018 at 04:53 UTC ( [id://1209715]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Levenshtein distance: calculating similarity of strings
in thread Levenshtein distance: calculating similarity of strings

There's also Benchmark.


Give a man a fish:  <%-{-{-{-<

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (7)
As of 2024-03-28 16:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found