{"id":"text-levenshtein-distance","version":"1.0.0","description":"Compute bounded Levenshtein distance over code points or deterministic grapheme tokens.","supported_operations":["compute levenshtein distance","unit cost edit distance","levenshtein over code points","count insertions deletions substitutions","classic string correction distance","minimum unit text edits"],"unsupported_operations":["unbounded text comparison","locale-sensitive collation","semantic similarity scoring"],"semantics":["Insertion, deletion, and substitution each cost one; equal tokens cost zero.","token_mode defaults to code_point. grapheme is a simple fixed rule, not UAX #29: a token is a character plus any following combining marks, variation selectors and emoji skin-tone modifiers, anything joined by U+200D stays together, and regional indicators pair up. So a\\u200db is one token, and CRLF, Hangul jamo, Indic conjuncts and emoji tag sequences stay split into several.","The result is the minimum cost from the Wagner-Fischer recurrence.","Pure bounded dynamic programming; no clock, locale, network, or randomness."],"limits":{"max_input_bytes":2048,"max_tokens_per_text":128,"max_cost":1000,"max_cells":16641},"pricing":{"status":"unpriced","charge_usd":null},"input_schema":{"type":"object","additionalProperties":false,"required":["source","target"],"properties":{"source":{"type":"string","maxLength":2048},"target":{"type":"string","maxLength":2048},"token_mode":{"type":"string","enum":["code_point","grapheme"]}}},"output_schema":{"type":"object","additionalProperties":false,"required":["distance","source_tokens","target_tokens"],"properties":{"distance":{"type":"integer","minimum":0,"maximum":512000},"source_tokens":{"type":"integer","minimum":0,"maximum":128},"target_tokens":{"type":"integer","minimum":0,"maximum":128}}},"examples":[{"input":{"source":"kitten","target":"sitting"},"output":{"distance":3,"source_tokens":6,"target_tokens":7}},{"input":{"source":"😀","target":"😃"},"output":{"distance":1,"source_tokens":1,"target_tokens":1}}],"execute_url":"/v1/tools/text-levenshtein-distance/versions/1.0.0/execute"}