Returns the levenshtein distance between s1 and s2 - a cost of 1 per character insertion, deletion or update. Runs in quadratic time and linear memory. Returns a list of strings in str-ls with the smallest edit distance to str, preserving order. If max-distance is provided and positive, only return if the edits are less or equal to that distance.