🔤 Rust implementations of string similarity metrics
-
Updated
Apr 3, 2024 - Rust
🔤 Rust implementations of string similarity metrics
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
A CLI spelling corrector for when you're unsure
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Python library for fast fuzzy search over a big file written in Rust
A collection of approximate string matching algorithms for Rust
LMS algorithm for computing edit distance with SIMD optimizations
Rust diff program that uses the Levenshtein algorithm to find the difference between two text files
Find the lowest cost sequence of edits between two trees
Represent large sets and maps compactly with finite state transducers.
Generates a shortest edit script (Myers' diff algorithm) to indicate how to get from the strings in column A to the strings in column B. Also provides the edit distance (levenshtein).
A command line implementation of levenshtein distance of two strings written in rust
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."