returned for Tags:"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.
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.
Google Places, Maps, Roads, Search and Translate. Requests and Responses are complete with Google api documentation and references.
Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.
4,322 total downloads
Library for working with GPS.
Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm
Library for working with measurements.
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
Provides a model for distance in the same style as TimeSpan does for time.
Core lib for basic location services operations like geocoding, reverse geocoding, routing and distance.
[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
This package contains geo-location representing data structures as well as some APIs for calculating distances between geo-locations
GoogleMaps lib for basic location services operations like geocoding, reverse geocoding, routing and distance.
660 total downloads
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
532 total downloads
A quick and memory efficient Levenshtein Distance calculator for .NET
Diseño de Sistemas 2016 UTN - Library to be used in the annual assigment.
Groups strings based on their edit distance (Levenshtein Distance).
This is a C# class library that uses public google maps API to give data for required location.
.NET object to handle distance.