8e0b6307-b50e-4e2c-85a6-dfe8975eed5b.png

this library is absolutely amazing. this has saved me so much time trying to find the closests value to my input values. it's so easy to use and works so quickly.

60a2f4ea-9f4d-4fb6-8d45-7c6db8a2fa7b.nupkg

9813a59c-a9e0-4ce9-9db6-e38d0c0c2968.png

The classical Levenshtein distance metric allows for the comparison between any two arbitrary strings. The "edit distance" measures how many additions, substitions, or deletions are needed to convert one string into another. While this is a powerful way to compare strings, it does have its limitations. 

The Damerau-Levenshtein distance is a little more robust, in that it includes transpositions/permutations as one way to manipulate a string. For example, "Hello" and "Helol" would have a D-L distance of 1, instead of 2, because it is possible to transpose the "o" and the "l". 

This library includes a lightweight D-L distance calculator, written in C#, which can take in two strings and output a distance between these two strings. 

Because many use-cases involve selecting an individual string from a collection of strings, this library also includes an activity which takes in a collection of strings and a chosen string, and it outputs the string from the original collection that matches most to the chosen string. 

This activity is meant to be used in workflows that include tokenization of texts, such that one token needs to be extracted from a larger body. 

Calculates the more robust Damerau-Levenshtein distance between two strings. Includes an activity for comparing a string against an array of strings to select the closest match. 

351611a8-5045-4036-bd5a-2c07ca6e4318.PNG

e1602871-eafe-4eea-9c91-e7cf4cc35ddb.PNG

MIT License Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

Visual Basic

Includes base activities: Calculate String Distance & Choose Closest String. 

Damerau–Levenshtein Distance - String Similarity

Damerau–Levenshtein Distance - String Similarity

ACP Digital - Advanced String Manipulation…

Levenshtein Distance Algorithm-String Comparison…

Roboyo - Advanced Fuzzy Logic …