Well, one thing we can say is that the editDistance between X and

Y will always be less than or equal to the hammingDistance between X and Y.

In other words, if you allow me to use only substitutions to turn X into Y,

I can do this with a certain minimal number of changes.

If you additionally allow me to use insertions and

deletions, I can potentially do it with fewer changes.

So here's an example.

So, here are two same length strings, X and Y.

And what's the hammingDistance between X and Y?

Again, that's not too hard.

We can just sort of go across and count the mismatches.

So one, two, three, four, five, etc., actually adds up to ten.

So the hammingDistance between X and Y is ten.