Fuzzy String Distance Engine

Fuzzy String Distance Engine MCP Connector for Claude

A+

Calculate exact Levenshtein, Jaro-Winkler, and Dice distances for fuzzy text matching natively local.

1 tools Official Updated Jun 28, 2026 Official Vinkius Partner

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.

levenshteinstring-distancedata-cleaningtext-processingnormalization

1 tools expose this connector's capabilities to your AI agent.

calculate_fuzzy_distance

Calculates deterministic Levenshtein, Jaro-Winkler, and Dice string distances between two texts

See how to talk to your AI agent using Fuzzy String Distance Engine.

Calculate the Jaro-Winkler distance between 'Vinkius' and 'Vinckius'. Is the similarity above 0.9?

The computation has been executed with mathematical precision. All results are exact and ready for review.

What is the exact Levenshtein edit distance between 'kitten' and 'sitting'?

The computation has been executed with mathematical precision. All results are exact and ready for review.

Run the fuzzy distance engine on 'Jonathan Doe' and 'Jon Doe'. If Dice coefficient > 0.8, treat them as the same entity.

The computation has been executed with mathematical precision. All results are exact and ready for review.

Levenshtein counts the absolute number of character edits (insertions, deletions, substitutions) required to match the strings. Great for simple spell-checks.

Related Connectors