39 packages returned for Tags:"levenshtein"

Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.

The one of the fastest Levenshtein distance packages on NuGet. Supports .NET Framework and .NET (.NET Standard 1.0/2.0). Levenshtein calculates the shortest possible distance between two strings. Producing a... More information

A .NET port of java-string-similarity.

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

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 quick and memory efficient Levenshtein Distance calculator for .NET

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... More information

A collection of extension methods to IQueryable and IEnumerable that enable easy and performance Levenshtein searches

Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm

Calculate distance between two string by levenshtein distance algorithm

[4.0, RT8, SL5, WP8.x] This lib adds some useful extension method to strings and IEnumerable<string> like: MakeAnagram, IsAnagramOf, ContainsAnagramOf, FindAnagramsFor, LevenshteinDistanceFrom,... More information

Simple strings Compares (measuring the difference between two sequences) In this version allow: - Levenshtein distance - Tanimoto coefficient - Hamming distance

Package Description

Library for fuzzy string matching. Can be used to find doublets or similarities between strings. -string metrics (Levenshtein, Jaccard, JaroWinkler,...) -algorithms (SortedNeigborhood, Blocking)... More information

Library (.Net Standard 1.0) to support text and person name matching. Currently contains Levenshtein and Damerau-Levenshtein (optimal string alignment version) edit distance and normalized similarity functions... More information

Simple strings Compares (measuring the difference between two sequences) In this version allow: - Levenshtein distance - Tanimoto coefficient - Hamming distance

A simple static library to find the nearest string in a list, and its edit distance, from a supplied string.

A library for performing edit distance calculation between strings.

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... More information