Return the Levenshtein edit distance between two sequences, defined as
the minimum of
numInsertions*insertCost + numDeletions*deleteCost +
numSubstitutions*substituteCost
over all possible sequences of insertions, deletions and substitutions
that transform s to t.