| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tottiest (0) - 6 freq totties (1) - 8 freq totiest (1) - 1 freq hottest (2) - 4 freq potties (2) - 1 freq tatties' (2) - 1 freq tastiest (2) - 2 freq titties (2) - 1 freq tottie (2) - 106 freq tatties (2) - 191 freq tottier (2) - 2 freq howtiest (2) - 1 freq tottie's (2) - 1 freq dottie (3) - 84 freq posties (3) - 3 freq dottert (3) - 1 freq dottit (3) - 11 freq pokiest (3) - 1 freq tattie's (3) - 1 freq tuttet (3) - 2 freq gutties (3) - 11 freq couthiest (3) - 1 freq 'tottie (3) - 1 freq wottles (3) - 1 freq attest (3) - 2 freq |
tottiest (0) - 6 freq totiest (2) - 1 freq totties (2) - 8 freq titties (3) - 1 freq tatties (3) - 191 freq tastiest (3) - 2 freq tatties' (3) - 1 freq hottest (3) - 4 freq tittert (4) - 1 freq attest (4) - 2 freq tottte (4) - 1 freq notteyst (4) - 1 freq fittest (4) - 3 freq fattest (4) - 1 freq tuttet (4) - 2 freq tittit (4) - 11 freq wettest (4) - 1 freq tattert (4) - 4 freq howtiest (4) - 1 freq tottie (4) - 106 freq tottie's (4) - 1 freq tottier (4) - 2 freq potties (4) - 1 freq tysties (5) - 1 freq stottert (5) - 8 freq |
SoundEx code - T323 thatched - 4 freq tottiest - 6 freq twitched - 7 freq thatch't - 1 freq tidesedge - 1 freq titch't - 1 freq titched - 2 freq th'ootside - 1 freq twa-edged - 1 freq totiest - 1 freq titcht - 1 freq tweetiesheed - 1 freq too-tight - 1 freq toadstool - 1 freq tweetstreetocc - 8 freq |
MetaPhone code - TTST tottiest - 6 freq deduced - 1 freq totiest - 1 freq detest - 2 freq |
TOTTIEST |
| Time to execute Levenshtein function - 0.587307 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.735509 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.028513 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.110546 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.000738 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. |