43 packages returned for Tags:"Levenshtein"

One of the fastest Levenshtein distance packages on NuGet. Supports .NET Framework and .NET. Levenshtein calculates the shortest possible distance between two strings. Producing a count of the number of... More information

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

A .NET port of java-string-similarity.

A Collection of Fuzzy String Algorithms for .NET. Partially derived from multiple open sources. See individual algorithm classes for attributions.

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

A Collection of Fuzzy String Algorithms for .NET Classic and .NET Core.

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

Levenshtypo - a .NET fuzzy matching string dictionary Levenshtypo is a library which allows you to search large data sets by fuzzy matching the key strings. The dataset is loaded upfront as a... More information

Calculate distance between two string by levenshtein distance algorithm

Fuzzy search library for finding strings in strings. Inspired by and attempts to be somewhat compatible with fuzzysearch for python https://github.com/taleinat/fuzzysearch

[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

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

Package Description

A utility library for comparing strings via the Levenshtein Distance algorithm

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

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