A much faster than the naïve Levenshtein distance algoritme
A set of tools to calculate edit distance and scores on a per word basis
Shared modules of the Helix Project - string
A tiny optimized package which finds the Levenshtein distance (edit distance) between two words. Having two strings of length N and M, the algorithm has O(N*M) complexity and uses O(N) additional space.
Sort strings based on spaces in string and then run edit distance to decrease false negatives.
fuzzy matching
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.
A package that is trying to implement all programming algorithms so that anyone can use them just by installing package and callinga function
AI gateway SDK for Node.js — cost control, session tracing, and security for LLM agents
A library to compare Vietnames names,addresses etc.
Simple benchmark for levenshtein using real-life data
Customizable edit distance calculator
string tools
A simple function that calculates the edit distance between two strings.
字符串最短编辑距离计算
A diff template library binding for node.js
Incremental evaluation metrics for various machine learning pipelines.
A pager for viewing FASTQ and FASTA files with fuzzy matching, allowing different adaptors to be colored differently.
Search, hash, sort, fingerprint, and fuzzy-match strings faster via SWAR, SIMD, and GPGPU
Fast algorithm for computing edit distance
Compute the edit-distance between vectors using the Wagner-Fischer algorithm
No description provided.
No description provided.