Have you ever wondered how spell-checkers actually work?
"a metric for measuring the amount of difference between two sequences. The Levenshtien distance between two strings is given by the minimum number of operations needed to transform one string into the other."
Basically, all the spell checkers search for short Levenshtein distances and allow you to choose the one that is write for you.
For example if you write "developen" but you meant "development" it will try the following:
- developen –> developmen (inserted the 'm')
- developmen –> development (inserted the 't')
So, the Levenshtein distance for those will be 2.
Is that cool or what?
(Inspired by Jeff Blankenburg)