MUSHclient scripting

Returns the "edit distance" between two words.

This is intended for use in the spell checker or similar applications, where you need to know how close one word is to another.

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.

For example, the Levenshtein distance between "kitten" and "sitting" is 3, since the following three edits change one into the other, and there is no way to do it with fewer than three edits:

1. kitten --> sitten (substitution of 's' for 'k')
2. sitten --> sittin (substitution of 'i' for 'e')
3. sittin --> sitting (insert 'g' at the end).

Note: Available in version 3.82 onwards.