| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thumbit (0) - 1 freq thumpit (1) - 2 freq thumbin (1) - 3 freq humpit (2) - 1 freq thumbs (2) - 11 freq thumpin (2) - 19 freq trumpit (2) - 5 freq dumbit (2) - 1 freq thumb (2) - 25 freq hummit (2) - 1 freq thunkit (2) - 1 freq thumban (2) - 1 freq tumit (2) - 1 freq tumblt (2) - 2 freq humbie (2) - 1 freq then-bit (3) - 1 freq tumilt (3) - 1 freq plumbin (3) - 5 freq tourit (3) - 2 freq thurot (3) - 3 freq tummilt (3) - 8 freq truckit (3) - 1 freq teuchit (3) - 3 freq mumpit (3) - 2 freq threit (3) - 18 freq |
thumbit (0) - 1 freq thumbin (2) - 3 freq thumpit (2) - 2 freq thumb (3) - 25 freq thumbs (3) - 11 freq thumban (3) - 1 freq tumit (4) - 1 freq thimble (4) - 13 freq humbie (4) - 1 freq thoomit (4) - 1 freq tumblt (4) - 2 freq thunkit (4) - 1 freq humpit (4) - 1 freq thumpin (4) - 19 freq trumpit (4) - 5 freq hummit (4) - 1 freq dumbit (4) - 1 freq timit (5) - 1 freq hobbit (5) - 2 freq thrivit (5) - 1 freq thum-an (5) - 2 freq thait (5) - 3 freq thump (5) - 33 freq thummart (5) - 2 freq theit (5) - 2 freq |
SoundEx code - T513 temptation - 22 freq tempt - 9 freq then-bit - 1 freq tempted - 23 freq thumped - 5 freq tounfuit - 2 freq temptit - 11 freq temptt - 1 freq temptin - 11 freq thumbit - 1 freq ten-foot - 2 freq tempit - 11 freq temptet - 1 freq tempter - 1 freq thumpeth - 1 freq timptations - 1 freq timptation's - 1 freq timptation - 1 freq temptan - 2 freq temptations - 2 freq tempts - 2 freq temptautioun - 1 freq thumpit - 2 freq ten-fit - 1 freq temptised - 1 freq tinpot - 3 freq tamped - 1 freq ten-foot-pole - 1 freq tempting - 3 freq temptress - 1 freq tenfeettallabdn - 1 freq |
MetaPhone code - 0MT thoomed - 3 freq thoomit - 1 freq thumbit - 1 freq themed - 2 freq thoumed - 1 freq |
THUMBIT |
| Time to execute Levenshtein function - 0.274186 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.410667 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.031696 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.042070 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.000935 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. |