Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
letterboax (0) - 4 freq letterbox (1) - 6 freq letter-box (2) - 9 freq lettermore (3) - 1 freq letterman (3) - 1 freq plesterboard (4) - 2 freq geerbox (4) - 1 freq pepper-boax (4) - 1 freq letter's (4) - 1 freq pepperbox (4) - 1 freq letters (4) - 142 freq letterit (4) - 1 freq netherbow (4) - 6 freq chatterbox (4) - 6 freq latter-day (4) - 1 freq lettert (4) - 8 freq ettercap (4) - 11 freq fetternear (4) - 1 freq clatterbag (4) - 2 freq letteris (4) - 1 freq lettern (4) - 1 freq leeteral (4) - 2 freq betterawa (4) - 3 freq setterda (4) - 1 freq lettering (4) - 2 freq |
letterboax (0) - 4 freq letterbox (1) - 6 freq letter-box (3) - 9 freq letterman (5) - 1 freq lettermore (5) - 1 freq clatterbag (6) - 2 freq lettert (6) - 8 freq latter-day (6) - 1 freq letteris (6) - 1 freq letterin (6) - 6 freq chatterbox (6) - 6 freq letter (6) - 240 freq lettern (6) - 1 freq lettering (6) - 2 freq letter's (6) - 1 freq letters (6) - 142 freq letterit (6) - 1 freq laetter (7) - 7 freq latterlie (7) - 2 freq lettir (7) - 2 freq littering (7) - 1 freq latterly (7) - 4 freq netherbow (7) - 6 freq litterin (7) - 1 freq litter (7) - 16 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 |
LETTERBOAX |
Time to execute Levenshtein function - 0.398367 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.703375 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.066524 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.083370 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.001225 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. |