levenshtein_distance
Calculate the minimum number of single-character edits required to transform one string into another. Useful for spell checking, DNA sequence analysis, and fuzzy string matching.
Instructions
Calculate the Levenshtein (edit) distance between two strings.
Use this to measure how many single-character edits (insert, delete,
substitute) are needed to change one string into another.
Parameters:
a — The first string.
b — The second string.
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": {
"a": "<a>",
"b": "<b>"
},
"name": "levenshtein_distance"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |