| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thoum-nail (0) - 1 freq thim-aal (4) - 1 freq hobnail (4) - 2 freq them-all (4) - 1 freq thum-aw (4) - 1 freq thum-an (4) - 2 freq thoumie (4) - 1 freq toenail (4) - 1 freq hotmail (4) - 3 freq hous-maid (4) - 1 freq houmit (5) - 1 freq thornhill (5) - 4 freq thundir (5) - 1 freq ploum-kake (5) - 1 freq tom-cat (5) - 1 freq thum- (5) - 1 freq hous-heid (5) - 1 freq houdini (5) - 4 freq throu-pit (5) - 2 freq thumsel (5) - 1 freq shouldni (5) - 1 freq shoud'nae (5) - 1 freq shoudna (5) - 6 freq thousant (5) - 4 freq haunil (5) - 1 freq |
thoum-nail (0) - 1 freq them-all (5) - 1 freq thum-an (5) - 2 freq thim-aal (5) - 1 freq thaim-an (6) - 2 freq thim-an (6) - 2 freq them-an (6) - 4 freq thum-aw (6) - 1 freq thumpin (7) - 19 freq thejournal (7) - 1 freq thaim-aa (7) - 1 freq thoomin (7) - 2 freq thumban (7) - 1 freq them-aw (7) - 1 freq autumnal (7) - 2 freq thumsel (7) - 1 freq thumbin (7) - 3 freq terminal (7) - 16 freq three-foil (7) - 1 freq thoumie (7) - 1 freq toenail (7) - 1 freq thum- (7) - 1 freq hobnail (7) - 2 freq thomasm (8) - 5 freq thummart (8) - 2 freq |
SoundEx code - T540 tunnel - 87 freq tummle - 19 freq thimmle - 4 freq them'll - 4 freq toonhill - 1 freq thinly - 2 freq twae-mile - 1 freq timely - 4 freq tinhalla - 1 freq tummel - 5 freq tummile - 1 freq tenniel - 2 freq thimel - 4 freq thim-aal - 1 freq tonal - 8 freq twin'll - 1 freq timmle - 4 freq time'll - 3 freq toenail - 1 freq them-all - 1 freq thoum-nail - 1 freq tannahill - 7 freq tonallie - 1 freq team'll - 1 freq thon'll - 1 freq towneley - 1 freq tonnel - 1 freq tamil - 1 freq ten'll - 1 freq €˜timely - 1 freq tommy'll - 1 freq tam'll - 1 freq tonyhill - 1 freq themole - 1 freq thnl - 1 freq tanle - 1 freq tommyle - 1 freq tommel - 1 freq |
MetaPhone code - 0MNL thoum-nail - 1 freq |
THOUM-NAIL |
| Time to execute Levenshtein function - 0.398825 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.526551 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.030720 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.038744 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.001029 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. |