edits.crEdit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Stars: ✭ 16 (-11.11%)
strutilGolang metrics for calculating string similarity and other string utility functions
Stars: ✭ 114 (+533.33%)
stringdistanceA fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..
Stars: ✭ 60 (+233.33%)
SymspellSymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Stars: ✭ 1,976 (+10877.78%)
LinSpellFast approximate strings search & spelling correction
Stars: ✭ 52 (+188.89%)
Jellyfish🎐 a python library for doing approximate and phonetic matching of strings.
Stars: ✭ 1,571 (+8627.78%)
edit-distance-papersA curated list of papers dedicated to edit-distance as objective function
Stars: ✭ 49 (+172.22%)
QuickenshteinMaking the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Stars: ✭ 204 (+1033.33%)
TextdistanceCompute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Stars: ✭ 2,575 (+14205.56%)
stringosimString similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
Stars: ✭ 47 (+161.11%)
simetricString similarity metrics for Elixir
Stars: ✭ 59 (+227.78%)
LevenshteinThe Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Stars: ✭ 38 (+111.11%)
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 (+13250%)
cejaPySpark phonetic and string matching algorithms
Stars: ✭ 24 (+33.33%)
UMICollapseAccelerating the deduplication and collapsing process for reads with Unique Molecular Identifiers (UMI). Heavily optimized for scalability and orders of magnitude faster than a previous tool.
Stars: ✭ 31 (+72.22%)
recursion-and-dynamic-programmingJulia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibo…
Stars: ✭ 37 (+105.56%)
astarixAStarix: Fast and Optimal Sequence-to-Graph Aligner
Stars: ✭ 60 (+233.33%)
Pg similarityset of functions and operators for executing similarity queries
Stars: ✭ 250 (+1288.89%)
Fuzzball.jsEasy to use and powerful fuzzy string matching, port of fuzzywuzzy.
Stars: ✭ 225 (+1150%)
Strsim Rs🔤 Rust implementations of string similarity metrics
Stars: ✭ 210 (+1066.67%)
LevenshteinGo implementation to calculate Levenshtein Distance.
Stars: ✭ 125 (+594.44%)
DictomatonFinite state dictionaries in Java
Stars: ✭ 124 (+588.89%)
FastenshteinThe fastest .Net Levenshtein around
Stars: ✭ 115 (+538.89%)
AbydosAbydos NLP/IR library for Python
Stars: ✭ 91 (+405.56%)
StopwordsRemoves most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
Stars: ✭ 83 (+361.11%)
Str metricsRuby gem (native extension in Rust) providing implementations of various string metrics
Stars: ✭ 68 (+277.78%)
Edit DistancePython library for computing edit distance between arbitrary Python sequences.
Stars: ✭ 61 (+238.89%)
SymspellcompoundSymSpellCompound: compound aware automatic spelling correction
Stars: ✭ 61 (+238.89%)
LevenshteinLevenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
Stars: ✭ 57 (+216.67%)
RapidfuzzRapid fuzzy string matching in Python using the Levenshtein Distance
Stars: ✭ 809 (+4394.44%)
Stringmetric🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein).
Stars: ✭ 481 (+2572.22%)
SymspellpyPython port of SymSpell
Stars: ✭ 420 (+2233.33%)
ClosestmatchGolang library for fuzzy matching within a set of strings 📃
Stars: ✭ 353 (+1861.11%)
Js LevenshteinThe most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Stars: ✭ 269 (+1394.44%)
Go EdlibGolang string comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Stars: ✭ 253 (+1305.56%)
similar-english-wordsGive me a word and I’ll give you an array of words that differ by a single letter.
Stars: ✭ 25 (+38.89%)
hubot-suggestSuggest hubot commands when not found
Stars: ✭ 29 (+61.11%)
java-sdk一些常用的java sdk和工具类(日期工具类,分布式锁,redis缓存,二叉树,反射工具类,线程池,对称/非对称/分段加解密,json序列化,http工具,雪花算法,字符串相似度,集合操作工具,xml解析,重试Retry工具类,Jvm监控等)
Stars: ✭ 26 (+44.44%)
spellchecker-wasmSpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Stars: ✭ 46 (+155.56%)
spark-stringmetricSpark functions to run popular phonetic and string matching algorithms
Stars: ✭ 51 (+183.33%)
customized-symspellJava port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Stars: ✭ 51 (+183.33%)
String SimilarityFinds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Stars: ✭ 2,254 (+12422.22%)
stanceLearned string similarity for entity names using optimal transport.
Stars: ✭ 27 (+50%)
bedaBeda is a golang library for detecting how similar a two string
Stars: ✭ 34 (+88.89%)
strsimstring similarity based on Dice's coefficient in go
Stars: ✭ 39 (+116.67%)