This is a sequel to this challenge: Code close to the challenge: Sum of integers
The challenge in this one is a bit harder, and also makes for a cool title (Which is why I picked it):
Calculate the Levenshtein distance between two strings
Just like last challenge, your score in this challenge is the Levenshtein distance between your code and the quote above.
So now for the details!
Your program will take 2 inputs, both strings with no trailing spaces or newlines, and will output the Levenshtein distance between them. Levenshtien distance is defined as the number of of additions, deletions, and substitutions necessary to transform one string to another. For more information on how to calculate it, see the Wikipedia page linked above. To test if your program works, use this calculator. Your program must output nothing but the Levenshtein distance between the two strings. It will be disqualified if anything else is outputted. Example I/O:
Inputs: test test2 Output: 1 Inputs: 222 515 Output: 3 Inputs: Test test Output: 1
Your code may not have no-ops or comments.