https://issues.dlang.org/show_bug.cgi?id=13834 --- Comment #1 from Martin Nowak <code at dawg.eu> --- Implementing the more space efficient variant of the algorithm when the final path isn't needed is another optimization. http://en.wikipedia.org/wiki/Levenshtein_distance#Iterative_with_two_matrix_rows --