A CLI spelling corrector for when you're unsure
-
Updated
Jun 26, 2024 - Rust
A CLI spelling corrector for when you're unsure
Levenshtein edit distance in Rust
LMS algorithm for computing edit distance with SIMD optimizations
Computes the pairwise similarity between multiple words
🔍 Levenshtein-Grouper: Uncover Textual Similarities Across Your File System in a Flash 🚀
A search engine for C functions by their signature
Strdiff is a library for calculating string differences. It leverages efficient algorithms such as the Levenshtein distance and the Damerau-Levenshtein distance.
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
A command line implementation of levenshtein distance of two strings written in rust
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Find the n-closests matches of a term within any whitespace-separated wordlist
fast fuzzy string matching for Python
edit distance algos: levenshtien, damerau, and hamming code
Represent large sets and maps compactly with finite state transducers.
Rust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."