Voynich anagramming

[bi3mw]

Yeah, Levenshtein distance counts every step (even swapping).

Code:

First Word: ol Second Word: lo The matrix:   0:    0    1    2   1:    1    1    1   2:    2    1    2 The edit distance is: 2 The alignment: ol_ _lo

Under Linux you might be able to do something with agrep or tre-agrep, but I'm not sure.