📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Repository Index
47,133 repositories indexed
1–9 of 9 · Most stars
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
A C++ implementation of timsort
Ruby & C implementation of Jaro-Winkler distance algorithm which supports UTF-8 string.
Swift implementation of the longest common subsequence (LCS) algorithm.
k-modes and k-prototypes clustering algorithms implementation in Go
Jump consistent hash implementation in Elixir (without NIFs)
Aldous-Broder algorithm implementation in Pascal for maze generation. Contains few optimizations.
Genetic Algorithm Implementation for Ada