An algorithm to find common edits

Question

I\'ve got two word lists, an example:

 list 1  list 2

 foot    fuut
 barj    kijo
 foio    fuau
 fuim    fuami
 kwim    kwami
 lnun    lnun
 kizm    kazm
         


        

Answer 1

You can use edit distance algorithms, for example, Levenshtein distance. It may be necessary to make some minor changes in algorithms to register exact modifications.