What's the difference between Levenshtein distance and the Wagner-Fischer algorithm
<p>The Levenshtein distance is a string metric for measuring the difference between two sequences. 
The Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.</p>

<p>Both using a matrix, and I don't see the difference? 
Is the difference the backtracking or is there no further difference by the fact that one is the "literature" and the other one is the programming? </p>

<p>Also I am just writing on a thesis, and I am not sure how to divide it- should I first get into explaining the Levenshtein distance first and afterwards the Wagner-Fisher algorithm or doing both in one? I got kinda confused here.</p>