25 packages returned for Tags:"levenshtein"

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 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

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

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

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

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

[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

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

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

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.... 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 optimized for speed and reduced memory consumption. There are also versions of the... More information

Groups strings based on their edit distance (Levenshtein Distance).

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

Simple and clean string metrics implementations: Hamming, Levenshtein and Damerau-Levenshtein

Text Utility Tools

Find a closer word in a list of synonyms.

Calculate distance between two string by levenshtein distance algorithm

A library for performing edit distance calculation between strings.