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.
A C# class library that will calculate distance and cardinal direction between two sets of coordinates and provides the lat/long boundaries around an origin coordinate allowing for simple SQL or LINQ selection of locations within the given radius.
Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.
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
High performance utility for calculating straight line distance between 2 valid UK postcodes. Only the postcode "outcodes" are used, so accuracy should be within a few miles - sufficient for radius searches / filters
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...
More information
