A little library to calculate the [edit distance](https://en.wikipedia.org/wiki/Edit_distance) between 2 strings, and allow returning the edit record path, transforming string1 -> string2.
PQ-Gram tree edit distance approximation in browsers and Node.js
String and tree edit distance
educational scripting language / shell with read-eval-print loop
TypeScript SDK for [Litmus](https://trylitmus.com) — implicit evals for AI products.
automatic alignment of sequences
Levenshtein edit distance between strings, a measure for similarity.
Spelling correction & Fuzzy search
An edit distance implementation derived from rustc, packaged for reuse.
Fast algorithm for computing edit distance
Public Rust API for Lattice Path Edit Distance and language adapters
Random passphrase generator
A basic edit distance implementation for korean characters
Weighted phonetic edit-distance — a Wagner-Fischer DP extended with arbitrary-length substitution pairs from a cost table. Ships a Mandarin Pinyin default table covering the canonical southern-dialect tolerances (zh↔z, sh↔s, ch↔c, n↔l, f↔h, r↔l, in↔ing, en↔eng, an↔ang).
Find the lowest cost sequence of edits between two trees
Search, hash, sort, fingerprint, and fuzzy-match strings faster via SWAR, SIMD, and GPGPU
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.