11
1
The Levenshtein edit distance between two strings is the minimum possible number of insertions, deletions, or substitutions to convert one word into another word. In this case, each insertion, deletion and substitution has a cost of 1.
For example, the distance between
roll
androlling
is 3, because deletions cost 1, and we need to delete 3 characters. The distance betweentoll
andtall
is 1, because substitutions cost 1.
Your task is to calculate the Levenshtein edit difference between an input string and your source. This is tagged quine, so cheating quines (for example, reading your source code) are not allowed.
Rules
The input will be non-empty and will be composed of ASCII, unless your source contains non-ASCII, in which case the input may include Unicode. Regardless, the Levenshtein distance will be measured in characters, not bytes.
The output is the minimum Levenshtein edit distance of the input and your source.
This is code-golf, so shortest answer, in bytes, wins.
Sandbox – Stephen – 2017-08-08T16:45:56.280
8I was going to suggest making the score the output of your program when run through itself, but then I realized... – ETHproductions – 2017-08-08T16:59:43.057
Closely related. – AdmBorkBork – 2017-08-08T17:29:38.853
@ETHproductions How did you even think of that? o_o – Erik the Outgolfer – 2017-08-08T17:31:45.827
Retina is so close to winning this with an empty program... – Leo – 2017-08-08T20:09:35.080