Re: Levenshtein distance: calculating similarity of strings

There are probably similar posts on this topic but I'd just like to mention String::Trigram. It's also a good algorithm and I found the documentation to be more than adequate. I used this to do fuzzy matching for a translation program (similar to what commercial translation programs do). I would be very interested to see if anyone has any benchmarks on these different algorithms.

Comment on Re: Levenshtein distance: calculating similarity of strings

Replies are listed 'Best First'.
Re^2: Levenshtein distance: calculating similarity of strings by Anonymous Monk on Jul 07, 2014 at 13:30 UTC
hello everyone, I am trying to get the separate results from the Levenshtein distance, namely the number of deleted, inserted and replaced characters. Do you have any idea? Thanks in advance.	[reply]
Re^3: Levenshtein distance: calculating similarity of strings by Anonymous Monk on Jul 08, 2014 at 02:18 UTC
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	[reply]
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]