levenshtein-distance

🦀📏 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

Comparing performance-oriented string-processing libraries for substring search, multi-pattern matching, hashing, edit-distances, sketching, and sorting across CPUs and GPUs in Rust 🦀 and Python 🐍

SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell

Levenshtein edit distance in Rust

Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.

Rust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm

SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

A search engine for C functions by their signature

LMS algorithm for computing edit distance with SIMD optimizations

An extremely fast Python library for the Levenshtein distance, written in Rust. 🦀

Represent large sets and maps compactly with finite state transducers.

Fast discovery of similar strings in bulk

A command line implementation of levenshtein distance of two strings written in rust

Blazing-fast string similarity library written in Rust with Python bindings. Covers edit distance, fuzzy matching, set-based, alignment, and vector algorithms

Levenshtein distance algorithm implementation in Rust

edit distance algos: levenshtien, damerau, and hamming code

Strdiff is a library for calculating string differences. It leverages efficient algorithms such as the Levenshtein distance and the Damerau-Levenshtein distance.

Instant typo prevention for Git commit messages.

Computes the pairwise similarity between multiple words