The one of the fastest Levenshtein distance packages on NuGet. Supports .NET Framework and .NET (.NET Standard 1.0/2.0). Levenshtein calculates the shortest possible distance between two strings. Producing a count of the number of insertions, deletions and substitutions to make one string into...
A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. Based upon F23.StringSimilarity
Library for fuzzy string matching. Can be used to find doublets or similarities between strings.
-string metrics (Levenshtein, Jaccard, JaroWinkler,...)
-algorithms (SortedNeigborhood, Blocking)
-phonetic codecs(Soundex, DoubleMetaphone, Phonix, ...)
Library (.Net Standard 1.0) to support text and person name matching.
Currently contains Levenshtein and Damerau-Levenshtein (optimal string alignment version) edit distance and normalized similarity functions optimized for speed and reduced memory consumption. There are also versions of the...
StringComparison is a library developed for reconciling naming conventions
between different models of the electric grid.
I have stripped off the power system specific code and put together
what can effectively be used as a string extension for determining approximate...