QuickenshteinMaking the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Stars: ✭ 204 (+257.89%)
Mutual labels: levenshtein-distance, string-distance
Java String SimilarityImplementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Stars: ✭ 2,403 (+4115.79%)
Mutual labels: levenshtein-distance, string-distance
seqalignCollection of sequence alignment algorithms.
Stars: ✭ 20 (-64.91%)
Mutual labels: string-distance
SymspellSymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Stars: ✭ 1,976 (+3366.67%)
Mutual labels: levenshtein-distance
LevenshteinThe Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Stars: ✭ 38 (-33.33%)
Mutual labels: levenshtein-distance
stanceLearned string similarity for entity names using optimal transport.
Stars: ✭ 27 (-52.63%)
Mutual labels: string-distance
FastFuzzyStringMatcherDotNetA BK tree implementation for fast fuzzy string matching
Stars: ✭ 23 (-59.65%)
Mutual labels: levenshtein-distance
strutilGolang metrics for calculating string similarity and other string utility functions
Stars: ✭ 114 (+100%)
Mutual labels: string-distance
levenshtein finderSimilar string search in Levenshtein distance
Stars: ✭ 19 (-66.67%)
Mutual labels: string-distance
LinSpellFast approximate strings search & spelling correction
Stars: ✭ 52 (-8.77%)
Mutual labels: levenshtein-distance
sentences-similarity-clusterCalculate similarity of sentences & Cluster the result.
Stars: ✭ 14 (-75.44%)
Mutual labels: levenshtein-distance
spellchecker-wasmSpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Stars: ✭ 46 (-19.3%)
Mutual labels: levenshtein-distance
seqalign pathingRust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm
Stars: ✭ 17 (-70.18%)
Mutual labels: levenshtein-distance
customized-symspellJava port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Stars: ✭ 51 (-10.53%)
Mutual labels: levenshtein-distance
bedaBeda is a golang library for detecting how similar a two string
Stars: ✭ 34 (-40.35%)
Mutual labels: string-distance
TextdistanceCompute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Stars: ✭ 2,575 (+4417.54%)
Mutual labels: levenshtein-distance
stringosimString similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
Stars: ✭ 47 (-17.54%)
Mutual labels: string-distance
polylevenFast Levenshtein Distance Library for Python 3
Stars: ✭ 37 (-35.09%)
Mutual labels: levenshtein-distance
levenshtein.cLevenshtein algorithm in C
Stars: ✭ 77 (+35.09%)
Mutual labels: levenshtein-distance
text2textText2Text: Cross-lingual natural language processing and generation toolkit
Stars: ✭ 188 (+229.82%)
Mutual labels: levenshtein-distance