Second Epoch Solutions






 Pangram Composer



 Programming Axioms

 UNIX Millenium Bug




 Follow Me

Matt Pullin


The Levenshtein distance between two strings A and B is the number of changes (addition, deletion, or substitutions) needed to get from string A to string B. The Levenshtein distance between "bee" and "beer" is 1, between "bee" and "deer" is 2, etc.

This game is in the spirit of the classic game "Mastermind". As you make guesses, you will be given clues about how many characters need to be inserted, deleted, or substituted in order to reach the secret word from your guess. See how fast you can reach the secret word.

To start, type your first guess in the field below and click Submit (or hit Enter). There will be a new secret word every day.







Deletions     © 2005-2017 Second Epoch Solutions