title: Determining a sequence of edits that produces the Levenshtein distance
body: <p>I am doing some work using Levenshtein (edit) distance using dynamic programming. I think I understand the Wagner-Fischer algorithm to do this efficiently. However, it doesn't look like the algorithm is constructive. If I compute that the edit distance between two strings is, e.g., 10, then I would also like to determine a particular sequence of 10 edits that turns one into the other. Can this be done efficiently too? If so, how?</p>