Measure the difference between two strings using the Levenshtein distance algorithm
Simply sort by similarity, starring Levenshtein via leven
Leven Labs Logging
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Similarity
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Return all word matches between two arrays within given Levenshtein distance
Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.
Git like diff between two strings, using the Levenshtein distance algorithm
Measure the difference between two strings using the Levenshtein distance algorithm
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Measure the difference between two strings using the Levenshtein distance algorithm
Levenshtein distance
A Search library, with integrated threshhold.
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Nino Haratischwili Het achtste leven is available now
> Levenstein implementation for korean
> NodeJs levenshtein distance algorithm.
Make your own blog!
Compute operational differences between two sequences using the Levenshtein algorithm.
Statistical post-hoc tests: Tukey HSD, Games-Howell, Dunnett, one-way ANOVA, and studentized range critical values — pure Rust, zero required dependencies
A curated list of awesome Rust frameworks, libraries and software.
Generic implementation of Levenshtein's algorithm that also allows you to generate the edits required to convert a source sequence to a target, and apply them to the source sequence to regenerate the target.
DSFB-Debug — Structural Semiotics Engine for Software Debugging. A deterministic, read-only, observer-only augmentation layer for execution-trace residual interpretation. Does NOT replace existing observability tools — augments them with typed structural interpretation.
Generate tokens based on indentation
PERMDISP (Anderson 2006) — test of homogeneity of multivariate group dispersions from a distance matrix (the betadisper analog), with a permutation p-value; scikit-bio skbio.stats.distance.permdisp equivalent
Statistical functions module for SciRS2 (scirs2-stats)
Levenshtein distance for ASCII or Unicode strings
my test
ElevenLabs TTS backend (REST + WebSocket streaming + voice cloning + SFX) for atomr-agents.
Provides a fast, cross-Ruby implementation of the levenshtein distance algorithm.
Calculates the Levenshtein distance between two byte strings.
Computes Levenstein distance between arrays of tokens, and gives the list of edits
Levenshtein ruby lib with unicode support
An average distance implementation of the hintable_levenshtein gem.
Calculates the Levenshtein distance between two byte strings.
A light wrapper around RForce to make working with Salesforce a little easier.
Levenshtein distance
Calculates the Levenshtein distance between two byte strings.
ruby implementation of levenshtein distance (https://github.com/akirahrkw/levenshtein-distance)
The levenshtein module implements fast Damerau-Levenshtein edit distance computation in O(n) memory and O(n^2) time, using a C wrapper.
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.
No description provided.
No description provided.