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.
A .NET port of java-string-similarity.
Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.
Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm
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
[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
A Collection of Fuzzy String Algorithms for .NET. Partially derived from multiple open sources. See individual algorithm classes for attributions.
A Collection of Fuzzy String Algorithms for .NET Classic and .NET Core.
A collection of extension methods to IQueryable and IEnumerable that enable easy searching and ranking. Searches can be performed against multiple properties and support a wide range of types
BlueSimilarity is a string similarity metric library with semantic learning optimized for speed and simple usage (edit distance - Levenshtein, Damerau-Levenshtein; Levenshtein, Damerau-Levenshtein, Jaro, Jaro-Winkler, Jaccard, Dice, Overlap, Semantic Bag of Words Similarity, TFIDF, SoftTFIDF)
Groups strings based on their edit distance (Levenshtein Distance).
Simple and clean string metrics implementations: Hamming, Levenshtein and Damerau-Levenshtein
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.
Calculate distance between two string by levenshtein distance algorithm
A library for performing edit distance calculation between strings.
Google Places, Maps, Roads, Search and Translate. Requests and Responses are complete with Google api documentation and references.
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...
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....
3,945 total downloads
Library for working with GPS.