returned for Tags:"levenshtein-distance"
The fastest Levenshtein on NuGet. Supports .NET Framework and .NET Core (.NET Standard 1.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 another.
Levenshtein Minimum Edit Distance
Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.
[4.0, RT8, SL5, WP8.x]
This lib adds some useful extension method to strings and IEnumerable<string> like:
MakeAnagram, IsAnagramOf, ContainsAnagramOf, FindAnagramsFor, LevenshteinDistanceFrom, OrderByLevenshteinDistanceFrom
Library is used to perform fuzzy matching (matching simillar strings). It uses Levenshtein Distance algorithms to perform this operation.
In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences....
Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm