Levenshtein Distance
LevenshteinDistanceLevenshtein Distance: Levenshtein Distance calculates the minimum number of single-character edits needed to transform one string into another. (Cost: 1 credit)
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"string1": "<string1>",
"string2": "<string2>"
},
"name": "LevenshteinDistance"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| string1 | Yes | First string to compare (max 10,000 characters) | |
| string2 | Yes | Second string to compare (max 10,000 characters) |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| data | No | ||
| error | No | Error message, null on success | |
| status | No | "ok" on success |