Dear colleages,
The Levenshtein distance between two strings is the minimum number of insertion, deletion, and substitution operations required to transform the first string into the second. The distance is named after the Russian scientist Vladimir Levenshtein, who introduced it in 1965.
The Levenshtein algorithm is used in Google search and, for example, also in WORD for error correction.
I have created an Add-On in which you can use this algorithm in every FM database. To make the results available for any table, a parameter table is added upstream, in which the necessary information can be entered.
There is an extension of Levenshtein’s algorithm that also recognizes transposed letters. A transposition is rated with only one operation, while the original algorithm requires 2 operations.
This algorithm is called Levenshtein-Damerau. This extension is quite helpful in practice, as input transpositions are relatively common and difficult to find.
For detailed information and for free download this Add-On please visit my website https://www.woisoft.de