Repository Index

Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖

• simd
• dataset
• string
• string-manipulation

📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

• distance
• algorithm
• python
• textdistance

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

• java
• levenshtein-distance
• cosine-similarity
• string-distance

Measure the difference between two strings with the fastest JS implementation of the Levenshtein distance algorithm

Find a needle (a document or record) in a haystack using string similarity and (optionally) regular expression rules. Uses Dice's Coefficient (aka Pair Similiarity) and Levenshtein Distance internally.

Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.

• sequence-alignment
• edit-distance
• levehnstein-distance
• library

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

• go
• golang
• edit-distance
• algorithms

Go implementation to calculate Levenshtein Distance.

• levenshtein
• levenshtein-distance
• golang

Rapid fuzzy string matching in C++ using the Levenshtein Distance

• cpp
• levenshtein
• string-matching
• string-similarity

Swift μ-framework for efficient array diffs and datasource adapters.

• edit-distance
• levenshtein-distance
• tableview
• datasource

Calculates edit distance using Damerau-Levenshtein algorithm

Fast string edit distance computation, using the Damerau-Levenshtein algorithm.

SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). This library support multiple .NET versions including .NET Core (NETStandard 1.x)

• string-metrics
• string
• distance-metric
• algorithms

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

• levenshtein
• levenshtein-distance
• similarity-metric
• common-prefix-bonus

String metrics and phonetic algorithms for Elixir (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein)

String similarity metrics for Elixir

• elixir
• jaro-winkler
• levenshtein
• distance

Calculate various string metrics efficiently in Common Lisp (Damerau-Levenshtein, Hamming, Jaro, Jaro-Winkler, Levenshtein, etc.)

• common-lisp
• string-metrics

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

• crystal
• edit-distance
• similarity-measures
• levenshtein