Please can someone explain how Levenshtein edit distance works?
I've stepped through the algorithm in code and in excel, but I don't understand how this actually succeeds in finding an edit distance.
Specifically, I don't understand how these algorithms are able to find the number of substitutions, deletions, and insertions. How does the matrix method correspond to this?
I really want to be able to grasp this process intuitively but haven't found any resources that teach it in a way I understand.