Levenshtein Distance MCP tool

MCP findutils:levenshtein_distance

Compute the Levenshtein edit distance between two strings (minimum single-character insertions, deletions, or substitutions to transform A into B). Also returns a normalised similarity in [0, 1].

Needs an API key. Running a tool needs an API key. Keys are not for sale yet: ask for early access. About API keys

Try it

Arguments

application/json

a

string required

First string.
b

string required

Second string.

Example arguments

Verified

{
  "a": "kitten",
  "b": "sitting"
}

claude mcp add findutils --transport http https://mcp.findutils.com/ --header "Authorization: Bearer YOUR_API_KEY"

{
  "mcpServers": {
    "findutils": {
      "url": "https://mcp.findutils.com/",
      "headers": {
        "Authorization": "Bearer YOUR_API_KEY"
      }
    }
  }
}

curl -X POST https://mcp.findutils.com/ \
  -H "Authorization: Bearer YOUR_API_KEY" \
  -H "Content-Type: application/json" \
  -d '{
    "jsonrpc": "2.0",
    "id": 1,
    "method": "tools/call",
    "params": {
      "name": "levenshtein_distance",
      "arguments": {
        "a": "kitten",
        "b": "sitting"
      }
    }
  }'

Also a REST endpoint

The same tool answers plain HTTP at POST /api/tools/levenshtein-distance/execute.

REST reference

Rate limit: 120 a minute, per IP
Auth: API key
REST id: levenshtein-distance
MCP name: levenshtein_distance
Category: Text
Machine-readable: openapi.json · markdown.md

Arguments

Example arguments

More Text tools

More to explore