Edit Distance

In this article I explain a dynamic programming approach to solve the edit distance problem. The only operations are deleting, replacing, and adding chars. Goal of this algorithm is that one given word should be transformed into another given word. The important note is that the edit costs should be minimal. Example Transform ‘Bier’ into ‘Berg’. Therefore, the ‘i’ must be removed and the ‘g’ must be added. The edit distance is 2....