Fuzzy String Distance Engine MCP Connector for Claude
A+Calculate exact Levenshtein, Jaro-Winkler, and Dice distances for fuzzy text matching natively local.
When deduplicating lists of names or correcting misspellings (e.g. 'John Smith' vs 'Jon Smyth'), semantic embeddings are overkill and LLM prompting is unpredictable. This engine provides the academic gold-standard string distances: Levenshtein (edit distance), Jaro-Winkler (prefix-heavy similarity), and Dice coefficient. Computed strictly in local JS, it gives agents a mathematical foundation for entity resolution.
Related Connectors
Comparison Copy Fairness Scorer MCP
Audit marketing copy and comparison tables for claim verifiability, feature balance, and disparagement risk.
MinHash Text Deduplicator MCP
Detect near-duplicate texts using MinHash signatures and Jaccard similarity.
Exact Text Diff and Patch Generator MCP
A deterministic engine for generating unified diffs and applying patches between text strings.
Diff Apply and Conflict Resolver MCP
Apply unified diffs to text with deterministic conflict resolution.