Levenshtein Distance, often just called "Edit Distance". The number of insertions, substitutions or deletions to turn one permutation (or string of equal length) into another.
first permutation (integer vector)
second permutation (integer vector)
numeric distance value
, scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)
Levenshtein, Vladimir I. "Binary codes capable of correcting deletions, insertions and reversals." Soviet physics doklady. Vol. 10. 1966.
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.