Find the n-closests matches of a term within any whitespace-separated wordlist
-
Updated
Nov 4, 2022 - Rust
Find the n-closests matches of a term within any whitespace-separated wordlist
edit distance algos: levenshtien, damerau, and hamming code
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
Add a description, image, and links to the damerau-levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein-distance topic, visit your repo's landing page and select "manage topics."