| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thoumire (0) - 2 freq thoumie (1) - 1 freq thourt (3) - 1 freq thrummie (3) - 1 freq hourie (3) - 2 freq thoomit (3) - 1 freq houmit (3) - 1 freq thu're (3) - 1 freq shuire (3) - 1 freq thorture (3) - 2 freq themirk (3) - 1 freq thoumed (3) - 1 freq tommie (3) - 1 freq thaire (3) - 47 freq thrummle (3) - 2 freq housie (3) - 1 freq thoum (3) - 13 freq shoutie (3) - 2 freq 'hou're (3) - 1 freq shougile (3) - 1 freq thoomin (3) - 2 freq thoums (3) - 2 freq thoctie (3) - 1 freq thortie (3) - 6 freq tourie (3) - 4 freq |
thoumire (0) - 2 freq thoumie (2) - 1 freq thaire (4) - 47 freq thoumed (4) - 1 freq thu're (4) - 1 freq themirk (4) - 1 freq thoomit (4) - 1 freq thoomin (4) - 2 freq thoum (4) - 13 freq thoums (4) - 2 freq thoo're (4) - 23 freq thre (5) - 2 freq thayme (5) - 1 freq thomp (5) - 1 freq thom (5) - 11 freq themorn (5) - 1 freq theme (5) - 38 freq th're (5) - 1 freq thiare (5) - 1 freq chaumer (5) - 116 freq thomas (5) - 80 freq there (5) - 6720 freq thoomed (5) - 3 freq they're (5) - 732 freq thums (5) - 1 freq |
SoundEx code - T560 thunner - 73 freq thinner - 14 freq the-morra - 2 freq tanner - 10 freq tomorrow - 41 freq timmer - 77 freq tenure - 4 freq tumour - 6 freq themorra - 24 freq tenner - 25 freq thonner - 45 freq 'thonner - 1 freq thonner' - 1 freq toner - 1 freq timer - 6 freq tamar - 2 freq ten'er - 1 freq 'tamara - 1 freq tamara - 16 freq tamer - 2 freq themarra - 1 freq thoner - 2 freq tenor - 4 freq tuner - 1 freq tomorrow' - 1 freq twa-hunner - 1 freq tonner - 1 freq thoumire - 2 freq thunnery - 1 freq to-morrow - 1 freq €˜thonner - 1 freq tinner - 1 freq €œtomorrow - 1 freq tenior - 1 freq tommorrow - 1 freq twa-hauner - 1 freq tamhere - 1 freq timor - 1 freq |
MetaPhone code - 0MR the-morra - 2 freq themorra - 24 freq themarra - 1 freq thoumire - 2 freq |
THOUMIRE |
| Time to execute Levenshtein function - 0.204654 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.373025 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.027396 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.043013 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.000831 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. |