Phil Chin
Because I'm getting old and this is how I try to remember stuff...
Ask me anything
twitter.com/ekkus93:
Ask me anything
twitter.com/ekkus93:
You’re Just a Baby - Belle & Sebastian (by Nightmarish666)
Levenshtein distance - Wikipedia, the free encyclopedia →
In information theory and computer science, the Levenshtein distance is a string metric for measuring the amount of difference between two sequences. The term edit distance is often used to refer specifically to Levenshtein distance.
The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character. It is named after Vladimir Levenshtein, who considered this distance in 1965.[1]
