So we now know when there is a deletion, addition, or substitution, we'll need to account for that. The key to understanding the levenshtein edit distance is that we'll use an array matrix to account for the n^2 possible transformations.

Here's a nice visual to grok how we'll apply this logic across a matrix:

Image credit to https://www.python-course.eu.