Does this algorithm find the shortest edit script?
Finding any diff is not really the problem.
Finding any diff is not really the problem.
The problem I had was that I just wanted a simple diff! It's for HTML rendering and not ultra complex at that: usually folks are only changing a few lines at a time, max, between any re-render.
[0] https://en.wikipedia.org/wiki/Longest_common_substring_probl...
Not that I have any particular expectation that this algorithm does unexpectedly well at that.
Not all proxies are equally good. Eg just going by Hamming distance or L2 norm distance would be awful. Proxies that take more features of our visual system into account are going to fare better.