levenshtein_distance
Calculate the minimum number of single-character edits (insert, delete, substitute) required to transform one string into another.
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.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |