| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| howtiest (0) - 1 freq holiest (2) - 2 freq howies (2) - 1 freq totiest (2) - 1 freq howest (2) - 1 freq tottiest (2) - 6 freq hottest (2) - 4 freq dowiest (2) - 1 freq rowtit (3) - 3 freq contest (3) - 16 freq owldest (3) - 5 freq yowtit (3) - 1 freq honest (3) - 195 freq foggiest (3) - 8 freq howdie (3) - 10 freq sorriest (3) - 1 freq shotties (3) - 3 freq hottert (3) - 1 freq hostit (3) - 7 freq foaties (3) - 1 freq howdied (3) - 2 freq ootmest (3) - 1 freq howes (3) - 18 freq cooties (3) - 1 freq hoagies (3) - 1 freq |
howtiest (0) - 1 freq howest (3) - 1 freq hottest (3) - 4 freq totiest (4) - 1 freq dowiest (4) - 1 freq holiest (4) - 2 freq howies (4) - 1 freq tottiest (4) - 6 freq hotses (5) - 1 freq hardiest (5) - 2 freq ahrtist (5) - 1 freq powtit (5) - 2 freq lowest (5) - 10 freq tawties (5) - 2 freq hoofnest (5) - 1 freq hoist (5) - 5 freq softest (5) - 1 freq hivviest (5) - 1 freq honist (5) - 1 freq dyowties (5) - 1 freq howzit (5) - 1 freq howpit (5) - 19 freq shortest (5) - 1 freq hertiess (5) - 1 freq bewties (5) - 1 freq |
SoundEx code - H323 hitched - 6 freq howtiest - 1 freq hatched - 9 freq hottest - 4 freq heidstanes - 10 freq headstart - 1 freq heidstane - 14 freq hitchit - 2 freq heidsteens - 4 freq heidsteen - 5 freq heetchid - 1 freq heetched - 1 freq hatchit - 2 freq heidswedgers - 2 freq 'hoots-toots - 1 freq hitcht - 1 freq hotched - 2 freq hyte-skyte - 1 freq heidstones - 3 freq heidstone - 2 freq hetchit - 1 freq heidstrap - 1 freq hedged - 2 freq hatchets - 1 freq hiddie-giddie - 1 freq heid-stane - 1 freq €”hottest - 1 freq hatcht - 1 freq hodged - 3 freq hatchet - 1 freq hotchit - 1 freq heid-hicht - 1 freq heidstrinker - 1 freq headset - 1 freq htscotpol - 5 freq hitsdingingdoon - 1 freq |
MetaPhone code - HTST howtiest - 1 freq hottest - 4 freq €”hottest - 1 freq headset - 1 freq |
HOWTIEST |
| Time to execute Levenshtein function - 0.226748 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.510035 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.028191 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.074708 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.000888 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. |