Search code examples
stringcomparisonlevenshtein-distanceedit-distance

Algorithm to find where exactly two strings match/differ


I am working on finding the similarity/differences in the source code of different java programs. I've used an implementation of the Levenshtein algorithm to find how similar two programs are. I want to know if there is any algorithm that can help in finding the exact positions where two strings differ.


Solution

  • You will find more than you ever wanted to know by looking at the inner workings of diff - see for example this link or simply the wiki article