| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| letterbox (0) - 6 freq letter-box (1) - 9 freq letterboax (1) - 4 freq letter (3) - 240 freq lettering (3) - 2 freq letterman (3) - 1 freq letterit (3) - 1 freq lettermore (3) - 1 freq chatterbox (3) - 6 freq lettert (3) - 8 freq pepperbox (3) - 1 freq letter's (3) - 1 freq letters (3) - 142 freq letteris (3) - 1 freq letterin (3) - 6 freq geerbox (3) - 1 freq lettern (3) - 1 freq netherbow (3) - 6 freq netter (4) - 6 freq metters (4) - 8 freq lether (4) - 2 freq leeteral (4) - 2 freq patterson (4) - 10 freq clettering (4) - 4 freq leeteracy (4) - 15 freq |
letterbox (0) - 6 freq letterboax (1) - 4 freq letter-box (2) - 9 freq letter's (5) - 1 freq letters (5) - 142 freq lettern (5) - 1 freq lettert (5) - 8 freq letterin (5) - 6 freq letteris (5) - 1 freq chatterbox (5) - 6 freq letter (5) - 240 freq lettering (5) - 2 freq letterman (5) - 1 freq lettermore (5) - 1 freq letterit (5) - 1 freq lottery (6) - 29 freq lettres (6) - 1 freq latter (6) - 25 freq lotterie (6) - 1 freq laetter (6) - 7 freq latterly (6) - 4 freq latterlie (6) - 2 freq lettir (6) - 2 freq letturs (6) - 3 freq littering (6) - 1 freq |
SoundEx code - L361 letterboax - 4 freq letterbox - 6 freq leather-bound - 3 freq leader-aff - 2 freq letter-box - 9 freq laudrup - 2 freq €˜laudrup - 1 freq ltrb - 1 freq |
MetaPhone code - LTRBKS letterboax - 4 freq letterbox - 6 freq letter-box - 9 freq |
LETTERBOX |
| Time to execute Levenshtein function - 0.219651 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.436600 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.028031 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037228 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000894 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |