Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
teatime (0) - 13 freq tea-time (1) - 8 freq tae-time (2) - 1 freq meantime (2) - 29 freq twatimes (2) - 1 freq taytime (2) - 1 freq mealtime (2) - 1 freq taetime (2) - 2 freq textile (2) - 2 freq oertime (2) - 2 freq toatie (2) - 6 freq bedtime (2) - 17 freq ae-time (2) - 5 freq meytime (2) - 1 freq tearie (2) - 1 freq tentive (2) - 1 freq teamie (2) - 1 freq tentie (2) - 38 freq treatise (2) - 2 freq treatie (2) - 2 freq teename (3) - 1 freq heapie (3) - 1 freq westie (3) - 2 freq telt'm (3) - 2 freq etive (3) - 1 freq |
teatime (0) - 13 freq taetime (2) - 2 freq taytime (2) - 1 freq tea-time (2) - 8 freq oertime (3) - 2 freq toatie (3) - 6 freq taytim (3) - 1 freq ttme (3) - 1 freq tae-time (3) - 1 freq ae-time (3) - 5 freq meytime (3) - 1 freq teamie (3) - 1 freq time (4) - 5878 freq thame (4) - 27 freq toate (4) - 1 freq totie (4) - 18 freq team (4) - 292 freq teath (4) - 1 freq tarim (4) - 1 freq stime (4) - 4 freq teetin (4) - 10 freq teitil (4) - 6 freq teetit (4) - 5 freq teat (4) - 1 freq teats (4) - 1 freq |
SoundEx code - T350 tea-time - 8 freq tidyin - 6 freq teatime - 13 freq tuition - 7 freq 'twadna - 1 freq tidn - 1 freq tooten - 2 freq tootin - 2 freq tweetin - 20 freq totonia - 1 freq teetin - 10 freq tattooin - 3 freq taytim - 1 freq tay-tim - 1 freq tuttin - 5 freq thythm - 1 freq tittin - 2 freq thuddin - 3 freq taetime - 2 freq two-tone - 1 freq tuttan - 1 freq teuton - 2 freq teitin - 1 freq teeden - 1 freq titan - 5 freq titania - 1 freq teethin - 1 freq titian - 1 freq tae-time - 1 freq taytime - 1 freq toadyin - 1 freq |
MetaPhone code - TTM tea-time - 8 freq didmae - 1 freq daytime - 7 freq teatime - 13 freq daytim - 1 freq taytim - 1 freq tay-tim - 1 freq taetime - 2 freq t'dem - 1 freq tae-time - 1 freq taytime - 1 freq |
TEATIME |
Time to execute Levenshtein function - 0.201153 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.356323 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.027184 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.036574 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.000790 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. |