| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etterin (0) - 1 freq letterin (1) - 6 freq utterin (1) - 3 freq betterin (1) - 3 freq enterin (1) - 20 freq efterkin (2) - 1 freq ettlin (2) - 314 freq utteran (2) - 1 freq hotterin (2) - 15 freq ettin (2) - 13 freq interin (2) - 1 freq watterin (2) - 12 freq butterin (2) - 2 freq efternin (2) - 11 freq pesterin (2) - 2 freq uttering (2) - 1 freq letterit (2) - 1 freq steerin (2) - 46 freq potterin (2) - 3 freq getherin (2) - 34 freq mutterin (2) - 40 freq eerin (2) - 2 freq sotterin (2) - 2 freq entering (2) - 9 freq oxterin (2) - 7 freq |
etterin (0) - 1 freq utterin (1) - 3 freq utteran (2) - 1 freq teeterin (2) - 6 freq letterin (2) - 6 freq yatterin (2) - 4 freq betterin (2) - 3 freq enterin (2) - 20 freq lettern (3) - 1 freq nytterin (3) - 1 freq natterin (3) - 4 freq etten (3) - 35 freq atterie (3) - 4 freq teerin (3) - 5 freq otteris (3) - 1 freq matterin (3) - 1 freq gutterin (3) - 5 freq hyterin (3) - 3 freq caterin (3) - 4 freq alterin (3) - 2 freq litterin (3) - 1 freq batterin (3) - 26 freq witterin (3) - 3 freq ettilin (3) - 1 freq tierin (3) - 2 freq |
SoundEx code - E365 eterne - 2 freq eternal - 25 freq etterin - 1 freq eternitie - 8 freq eternally - 7 freq eternity - 18 freq ethernan - 5 freq ethernan's - 1 freq eternity's - 2 freq eternell - 1 freq eduroam - 1 freq edrom - 1 freq |
MetaPhone code - ETRN eterne - 2 freq etterin - 1 freq |
ETTERIN |
| Time to execute Levenshtein function - 0.205278 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.401875 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.027499 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.038623 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.001124 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. |