| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hottest (0) - 4 freq hottert (1) - 1 freq hotness (2) - 1 freq howtiest (2) - 1 freq dottert (2) - 1 freq hotses (2) - 1 freq attest (2) - 2 freq tottiest (2) - 6 freq notteyst (2) - 1 freq dottelt (2) - 1 freq totiest (2) - 1 freq wettest (2) - 1 freq hotter (2) - 8 freq hottit (2) - 1 freq hostess (2) - 2 freq cottert (2) - 1 freq rottet (2) - 1 freq hattert (2) - 1 freq fattest (2) - 1 freq holiest (2) - 2 freq bottelt (2) - 1 freq howest (2) - 1 freq ootmest (2) - 1 freq contest (2) - 16 freq softest (2) - 1 freq |
hottest (0) - 4 freq hottert (2) - 1 freq totiest (3) - 1 freq hattert (3) - 1 freq wettest (3) - 1 freq fittest (3) - 3 freq hottit (3) - 1 freq notteyst (3) - 1 freq tottiest (3) - 6 freq howtiest (3) - 1 freq fattest (3) - 1 freq attest (3) - 2 freq contest (4) - 16 freq ootmest (4) - 1 freq softest (4) - 1 freq shortest (4) - 1 freq hettit (4) - 1 freq €”hottest (4) - 1 freq howest (4) - 1 freq mostest (4) - 1 freq honest (4) - 190 freq dottelt (4) - 1 freq hotses (4) - 1 freq hotness (4) - 1 freq bottelt (4) - 1 freq |
SoundEx code - H323 hitched - 6 freq howtiest - 1 freq hatched - 9 freq hottest - 4 freq heidstanes - 9 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 |
HOTTEST |
| Time to execute Levenshtein function - 0.202996 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.337991 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.026858 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.038489 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.000828 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. |