Compute edit distance
levenshtein(s1, s2)first character vector
second character vector
the integer number of edits between strings
If neither string is greater than ten characters, there is no allocation. Otherwise, allocation is amortized constant.