| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hotterin (0) - 15 freq hotteran (1) - 1 freq potterin (1) - 3 freq totterin (1) - 1 freq sotterin (1) - 2 freq stotterin (2) - 8 freq nytterin (2) - 1 freq hoverin (2) - 23 freq patterin (2) - 6 freq otteris (2) - 1 freq gutterin (2) - 5 freq natterin (2) - 4 freq hooverin (2) - 5 freq howderin (2) - 3 freq yatterin (2) - 4 freq hottered (2) - 6 freq matterin (2) - 1 freq hotter (2) - 8 freq litterin (2) - 1 freq hollerin (2) - 2 freq batterin (2) - 28 freq footerin (2) - 8 freq shutterin (2) - 4 freq lotterie (2) - 1 freq botherin (2) - 13 freq |
hotterin (0) - 15 freq hotteran (1) - 1 freq sotterin (2) - 2 freq totterin (2) - 1 freq potterin (2) - 3 freq letterin (3) - 6 freq shutterin (3) - 4 freq shatterin (3) - 1 freq chatterin (3) - 4 freq batterin (3) - 28 freq utterin (3) - 3 freq hottert (3) - 1 freq etterin (3) - 1 freq hotterel (3) - 1 freq mutterin (3) - 40 freq litterin (3) - 1 freq chitterin (3) - 44 freq hottered (3) - 6 freq patterin (3) - 6 freq gutterin (3) - 5 freq hyterin (3) - 3 freq nytterin (3) - 1 freq watterin (3) - 12 freq hotter (3) - 8 freq natterin (3) - 4 freq |
SoundEx code - H365 howderin - 3 freq hawthorn - 3 freq hotterin - 15 freq hadrons - 1 freq hotteran - 1 freq hadrian's - 4 freq heedrum-hodrums - 28 freq 'heedrum-hodrums - 2 freq 'heedrum - 1 freq hodrums - 1 freq heedrum-hodrumland - 1 freq heedrum-hodrumss - 2 freq heedrum-hodrum - 18 freq heedrumhodrum - 3 freq heedrum-hodrumish - 1 freq heedrumhodrums - 6 freq 'heedrum-hodrum - 4 freq heedrum-hodrum's - 1 freq hither-an-yon - 2 freq hadrian - 6 freq hodrum - 1 freq hyterin - 3 freq haterent - 1 freq heteronormative - 2 freq headroom - 1 freq heathermc - 8 freq heathermorven - 1 freq |
MetaPhone code - HTRN howderin - 3 freq hotterin - 15 freq hotteran - 1 freq hadrian - 6 freq |
HOTTERIN |
| Time to execute Levenshtein function - 0.218191 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.412881 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.030190 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.043045 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.001229 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. |