31 packages returned for Tags:"Levenshtein"

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

Text Utility Tools

IEnumerableCorrelater knows to compare two IEnumerables or strings. It returns the distance between them, and returns two arrays which represent their "best match". IEnumerableCorrelater can be used to create diff tools.

A library for performing edit distance calculation between strings.

A C# implementation of the Levenshtein string distance, using lazy evaluation of its diagonals. Time Complexity: O( |a| * dist(A,B) ) Supports thresholding to skip calculations when distance is greater than the threshold https://www.codeinthenorth.com

Find a closer word in a list of synonyms.

Fast Levenshtein (fast-levenshtein) binding library for Bridge.NET projects.

Levenshtein binding library for Bridge.NET projects.

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

Common String and SecureString Extension Methods which include: ToSecureString, ToInsecureString, EqualsIgnoreCase, ContainsIgnoreCase, Before, After, IsNullOrEmpty, and IsNullOrWhiteSpace. Yarn icon source: https://pixabay.com/vectors/yarn-ball-needles-wool-craft-309401/

this package is based on Levenshtein Distance Algorithm: eg. first string ="abc rs t" secind string ="acb ts t" levenshtein distance =3 similarity ratio = 0.625 it is useful to understand how much both input strings are similar.