There are 1 repository under string-comparison topic.
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Rapid fuzzy string matching in C++ using the Levenshtein Distance
🔀 Extension method for StringComparison that adds support for natural sorting (e.g. "abc1", "abc2", "abc10" instead of "abc1", "abc10", "abc2").
Ruby gem (native extension in Rust) providing implementations of various string metrics
Python library for fast approximate string matching using Jaro and Jaro-Winkler similarity
🤠A library implementing different string similarity using JavaScript.
string similarity based on Dice's coefficient in go
A collection of metrics and phonetic algorithms for fuzzy string matching in Elixir.
Extensions for sorting strings using natural sort order i.e. Alphabetical order for humans
A collection of string comparisons algorithms
Simple library providing functions to simplify conversions in Lazarus when passing strings to RTL or WinAPI.
Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.
regular expression functionality for ctrl+f search
Class library to compare strings in a relative way.
A java application that highlights text differences between two plain strings based on longest common subsequences
Fuzzy string comparison library
:hourglass: Timing attack safe string comparison
Enables better web page searching functionality for browsers
String comparison and string search optimisation repertoire, written in C++, Python3 and Typescript
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Compare two strings with help of Levenshtein Distance Metric and weighted string decomposition. Allows to get a measure of the similarity of two strings in percentage terms.
Insert Java programs here.
strcompare is a library for comparing strings using Hamming, Levenshtein, and Damerau-Levenshtein metrics.
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
C and C++ library for fast, caseless (case-insensitive) comparison of Unicode utf-8 strings