Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^3: Levenshtein distance: calculating similarity of strings

by Anonymous Monk
on Jul 08, 2014 at 02:18 UTC ( [id://1092660]=note: print w/replies, xml ) Need Help??


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

Hi :) You're asking goldbug was last here 11 years ago :) and can't hear you. See on necromancy (reviving old threads) and The Perl Monks Guide to the Monastery

If you want to ask everybody go to new question: Seekers of Perl Wisdom

OTOH, going to cpan is always a good idea, Levenshtein deleted, Levenshtein deleted

  • Comment on Re^3: Levenshtein distance: calculating similarity of strings

Replies are listed 'Best First'.
Re^4: Levenshtein distance: calculating similarity of strings
by Anonymous Monk on Apr 17, 2017 at 16:53 UTC
    I do hope s/he is still alive and well.
[reply]

In Section Cool Uses for Perl

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://1092660]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others admiring the Monastery: (11)
As of 2024-04-18 14:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found