in reply to 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.

        I do hope s/he is still alive and well.