levenshtein state

Distance

Distance returns the Levenshtein edit distance between a and b. It counts single-rune insertions, deletions, and substitutions and works on runes (not bytes), so multi-byte UTF-8 input is handled correctly. The classic two-row DP is used, so memory is O(min(len)) and time is O(len(a)\*len(b)).

Matrix

Matrix returns the full (len(a)+1) x (len(b)+1) DP matrix used by Distance. matrix\[i]\[j] is the edit distance between the first i runes of a and the first j runes of b. The bottom-right cell equals Distance(a, b).

Similarity

Similarity returns a 0..100 percentage of how similar a and b are, defined as (1 - distance/maxLen) \* 100 rounded to the nearest integer. Two empty strings are considered 100% similar.

min3

renderTable

renderTable formats the DP matrix as a Markdown table with a and b as headers.

Render

Render implements the gnoweb view. - "" or "/" : explanation + examples. - "/\<a>/\<b>" : distance between a and b, with the DP table.

renderHome