Important information

This site uses cookies to store information on your computer. By continuing to use our site, you consent to Steel Media's privacy policy.

Steel Media websites use two types of cookie: (1) those that enable the site to function and perform as required; and (2) analytical cookies which anonymously track visitors only while using the site. If you are not happy with this use of these cookies please review our Privacy Policy to learn how they can be disabled. By disabling cookies some features of the site will not work.


Download on the AppStore Click here to request a review of this app

  • App Store Info


Test your mental mind capabilities with Levy!

The Levenshtein distance between two words is defined as the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other.

For example, the words 'mitten' and 'sitting' have a Levenshtein distance of 3. The 'm' would be substituted for an 's', the 'e' would be substituted for an 'i' and a 'g' would be inserted at the end.

It is named after Vladimir Levenshtein, who first considered this distance in 1965.

Your objective in Levy is to determine which of the three options is the specified number of edits away from word at the top of the screen before time runs out!

What's New in Version 1.1

- Better word selection
- More challenging time constraints
- High Score Tracking
- Squashed a colony of bugs


Screenshot 1 of 3 Screenshot 2 of 3 Screenshot 3 of 3