44 packages 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.

Google Places, Maps, Roads, Search and Translate. Requests and Responses are complete with Google api documentation and references.

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.

Library for working with GPS.

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

Library for working with measurements.

Core lib for basic location services operations like geocoding, reverse geocoding, routing and distance.

Provides a model for distance in the same style as TimeSpan does for time.

[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 q: info@antonioesposito.it

GoogleMaps lib for basic location services operations like geocoding, reverse geocoding, routing and distance.

This package contains geo-location representing data structures as well as some APIs for calculating distances between geo-locations

A quick and memory efficient Levenshtein Distance calculator for .NET

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

Diseño de Sistemas 2016 UTN - Library to be used in the annual assigment.

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

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.