Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
string-distance 开源项目推荐(73 个)
string-distance 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 前 20
按 Star 数排序展示前 20 个 · GitHub 共 73 个仓库A powerful and modular toolkit for record linkage and duplicate detection in Python
Java fuzzy string matching implementation of the well known Python's fuzzywuzzy algorithm. Fuzzy search for Java
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
A .NET port of java-string-similarity
Go metrics for calculating string similarity and other string utility functions
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Natural Language Processing (NLP) library for Crystal
A Privacy focused, easy sharable, open source and anonymous tracking diff viewer.
String Distances in Julia
Lexicographically-subdivide the “space” between strings, by defining an alternate non-base-ten number system using a pre-defined dictionary of symbol↔︎number mappings. Handy for ordering NoSQL keys.
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
Ruby gem (native extension in Rust) providing implementations of various string metrics
Fuzzy string matching for PHP
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
📐 A Cython implementation of the affine gap string distance
Beda is a golang library for detecting how similar a two string
High-performance fuzzy string matching for .NET with bit-parallel Levenshtein/Indel algorithms, FuzzyWuzzy-compatible scorers, and fast extraction APIs.
Learned string similarity for entity names using optimal transport.
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 20 个项目;原始页面见 https://github.com/topics/string-distance。
- 该话题在 GitHub 上共有 73 个仓库, 本站收录的是其中最热门的 20 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 20 个项目累计 7773 Star,覆盖 12 种主要语言,数据更新于 2026-11-07。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。