Diff, Match and Patch

Diff takes two texts and finds the differences. This implementation works on a character by character basis. The result of any diff may contain 'chaff', irrelevant small commonalities which complicate the output. A post-diff cleanup algorithm factors out these trivial commonalities.

Text 1

Chars: 210, Words: 36, Lines: 5

Text 2

Chars: 220, Words: 41, Lines: 5