uuid a83afccf-19d9-4b34-a36b-57d2fcc74417 and the Levenshtein distance
A quick demonstration measuring two universally unique identifiers using the Levenshtein distance
The Levenshtein distance is the difference between two strings when compared, specifically the amount of changes that have to be made to achieve a match, the function is named after Vladimir Levenshtein, a Soviet mathematician.
The below values are calculated using the PHP implementation of the Levenshtein metric and more information regarding this function can be found here.
On every page refresh a new uuid will be generated and compared against the existing uuid, a similarity percentage and the Levenshtein distance will be calculated and shown.
30d4aa2d-1336-4bf8-bead-3ac122c913ce with a Levenshtein distance of 28.