| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hottert (0) - 1 freq cottert (1) - 1 freq hotter (1) - 8 freq hattert (1) - 1 freq dottert (1) - 1 freq hottest (1) - 4 freq totter (2) - 2 freq hooters (2) - 3 freq guttert (2) - 1 freq sotter (2) - 34 freq doitert (2) - 1 freq uttert (2) - 1 freq oxtert (2) - 6 freq hitters (2) - 1 freq jotter (2) - 31 freq oftert (2) - 1 freq hottered (2) - 6 freq hottit (2) - 1 freq tortert (2) - 1 freq tattert (2) - 4 freq muttert (2) - 25 freq otter (2) - 3 freq rottet (2) - 1 freq bottelt (2) - 1 freq hytert (2) - 3 freq |
hottert (0) - 1 freq hattert (1) - 1 freq dottert (2) - 1 freq hottest (2) - 4 freq hotter (2) - 8 freq cottert (2) - 1 freq lettert (3) - 8 freq battert (3) - 9 freq nattert (3) - 1 freq hotterin (3) - 15 freq hotteran (3) - 1 freq hytert (3) - 3 freq hatters (3) - 5 freq hatter (3) - 279 freq wattert (3) - 5 freq chattert (3) - 4 freq muttert (3) - 25 freq hoatter (3) - 1 freq buttert (3) - 7 freq chittert (3) - 3 freq hottit (3) - 1 freq pittert (3) - 1 freq uttert (3) - 1 freq fittert (3) - 1 freq guttert (3) - 1 freq |
SoundEx code - H363 hottert - 1 freq hottered - 6 freq heathered - 1 freq hattered - 7 freq hatred - 28 freq hudderyheided - 1 freq hithertae - 4 freq hytered - 3 freq hytert - 3 freq hatreds - 1 freq hudderie-dudderie - 1 freq het-trod - 1 freq het-trods - 1 freq het-troddin - 1 freq hydrodgen - 1 freq hitherto - 2 freq hithertil - 1 freq hattert - 1 freq hudderie-heidit - 1 freq heidword - 5 freq heietered - 1 freq heatherdunnn - 2 freq headword - 1 freq |
MetaPhone code - HTRT hottert - 1 freq hottered - 6 freq hattered - 7 freq hatred - 28 freq hattert - 1 freq heietered - 1 freq |
HOTTERT |
| Time to execute Levenshtein function - 0.532144 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 - 1.062991 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.032225 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.093087 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.001186 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. |