#

damerau-levenshtein-distance

https://static.github-zh.com/github_avatars/life4?size=40

#算法刷题#📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

Python 3.49 k
5 个月前
https://static.github-zh.com/github_avatars/life4?size=40
Rust 296
10 个月前
https://static.github-zh.com/github_avatars/schiffma?size=40

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

C 24
4 年前
https://static.github-zh.com/github_avatars/zauri?size=40

Sequence clustering using k-means with dynamic time warping (DTW) and Damerau-Levenshtein distance as similarity measures

Python 20
3 年前
https://static.github-zh.com/github_avatars/robertgr991?size=40

Cython implementation of true Damerau-Levenshtein algorithm.

Python 19
2 年前
https://static.github-zh.com/github_avatars/lmas?size=40

This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein

Go 11
2 年前
https://static.github-zh.com/github_avatars/fabvalaaah?size=40

NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings

JavaScript 11
3 年前
https://static.github-zh.com/github_avatars/kyr0?size=40

#搜索#A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state ...

TypeScript 10
2 年前
https://static.github-zh.com/github_avatars/vincent-scw?size=40

String.Search is a simple library to implement a full text search with given patterns.

C# 7
5 年前
https://static.github-zh.com/github_avatars/sp1ff?size=40

Comparison of a few algorithms for computing Damerau–Levenshtein distance

Shell 7
1 年前
https://static.github-zh.com/github_avatars/Philippus?size=40

🧸 Tiny optimal string alignment distance library

Scala 5
8 天前
https://static.github-zh.com/github_avatars/ZviRosenfeld?size=40

IEnumerableCorrelater knows to compare two IEnumerables or strings. It returns the distance between them, and returns two arrays which represent their "best match". IEnumerableCorrelater can be used t...

C# 2
4 年前
https://static.github-zh.com/github_avatars/holmanb?size=40
Rust 1
4 年前
https://static.github-zh.com/github_avatars/el3um4s?size=40

Calculate the Damerau–Levenshtein distance between strings.

TypeScript 1
5 年前
https://static.github-zh.com/github_avatars/taKana671?size=40

Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance

Python 1
3 年前
https://static.github-zh.com/github_avatars/rahmed31?size=40

#自然语言处理#This repository implements a brute-force spellchecker utilizing the Damerau-Levenshtein edit distance.

Python 1
4 年前
loading...
Website
Wikipedia