11-12-2024 04:11 AM
Hello,
Contextualizing, in my software I have a translation search system, and I would like to search for the most similar phrases so that the user can see if the translation already exists, or at least a similar one so that he can reuse it. I'm using the Levenshtein Distance algorithm to check the closest sentences and according to this "note", I want to rearrange the array, from the lowest note to the highest
But I'm not able to do this efficiently, can you help me?
11-12-2024 05:00 AM
In assumption that the Levenshtein works properly, may by you can simplify this up to the following:
11-12-2024 05:15 PM
I've made a UTF-8 version of your "Levenshtein Distance.vi" and added it to my UTF-8 library.