The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
-
Updated
Apr 11, 2025 - C++
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
High-performance and memory efficient native C++ text similarity algorithms for Node.js
Algorithms to compute the Burrows-Wheeler Similarity Distributions [SPIRE'18, TCS 2019]
StringSimilarity.cpp - C++ Classes for Calculating String Similarity Using Character Embeddings
Basic seed-and-extend DNA sequence read aligner
C++ functions to judge the similarity of strings. Originally created to correct messy human input. Also compiles to Web Assembly.
Implementation of large scale genome comparisons. Utilizes McCreight Suffix tree construction algorithm as well as a modified Pairwise Sequence Alignment algorithm with an Affine Gap Penalty. Implemented in C++.
Add a description, image, and links to the string-similarity topic page so that developers can more easily learn about it.
To associate your repository with the string-similarity topic, visit your repo's landing page and select "manage topics."