Exact Levenshtein Distance Calculator

Exact Levenshtein Distance Calculator MCP Connector for Claude

A+

Compute precise edit distances and string similarity scores.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner

This MCP server provides high-precision algorithms for measuring the difference between two strings. It allows AI agents to calculate the exact Levenshtein edit distance, which counts insertions, deletions, and substitutions. Additionally, it supports Damerau-Levenshtein distance by accounting for transpositions of adjacent characters, and Jaro-Winkler similarity for a percentage-based matching score. This is essential for tasks involving spell checking, DNA sequence analysis, or fuzzy name matching.

levenshteindamerau-levenshteinjaro-winklerstring-similarityedit-distance

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

jaro_winkler_similarity

Computes the Jaro-Winkler similarity percentage between two strings

levenshtein_distance

Computes the exact Levenshtein edit distance between two strings

damerau_levenshtein_distance

Computes the Damerau-Levenshtein distance between two strings

See how to talk to your AI agent using Exact Levenshtein Distance Calculator.

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

The Levenshtein distance between 'kitten' and 'sitting' is 3.

Calculate the Jaro-Winkler similarity for 'martha' and 'marhta'.

The Jaro-Winkler similarity score is approximately 100%.

Check the Damerau-Levenshtein distance for 'ca' and 'abc'.

The Damerau-Levenshtein distance is 2.

Standard Levenshtein distance only considers insertions, deletions, and substitutions. `damerau_levenshtein_distance` also accounts for transpositions (swapping two adjacent characters) as a single edit.

Related Connectors