{"resource":"https://similarity.openverbs.com/v1/levenshtein","service":"Levenshtein distance","areas":["other"],"answering":true,"http_status":402,"latency_ms":391,"price_usdc":0.004,"buyers_30d":2,"calls_30d":2,"description":"Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.","id":"f149950a4936","category":"Unclassified","accuracy":null,"tool_calls":null,"checked_day":"2026-10-11","page":"https://velliumandco.com/sellers/f149950a4936"}