What is an Algorithm to Diff the Two Strings in the Same Way that SO Does on the Version Page?

Question

I\'m trying to diff two strings by phrase, similar to the way that StackOverflow diffs the two strings on the version edits page. What would be an algorithm to do this? Are ther

Answer 1

The algorithm you are looking for is Longest Common Subsequence it does most of the work for you.

The outline is something along these lines.

1. Split by word (input, output)
2. Calculate LCS on input / output array.
3. Walk through the array and join up areas intelligently.

So for example say you have:

"hello world this is a test"

compared with:

"mister hello world"

The result from the LCS is

• "mister" +
• "hello" =
• "world" =
• "this" -
• "is" -
• "a" -
• "test" -

Now you sprinkle the special sauce when building up. You join the string together while staying mindful of the previous action. The naive algorithm is just join sections that are the same action.

• "mister" +
• "hello world" =
• "this is a test" -

Finally you transform it to html:

<ins>mister</ins> hello world <del>this is a test</del>  

Of course the devil is in the detail:

• You need to consider how you handle tags
• Do you compare markdown or html
• Are there any edge cases where the UI stops making sense.
• Do you need special handling for punctuations.