| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| howkin (0) - 59 freq hawkin (1) - 3 freq kowkin (1) - 1 freq cowkin (1) - 2 freq howrkin (1) - 1 freq howlin (1) - 57 freq howkit (1) - 29 freq fowkin (1) - 1 freq hokin (1) - 11 freq gowkin (1) - 2 freq howfin (1) - 5 freq powkin (1) - 24 freq hoakin (1) - 1 freq hockin (1) - 4 freq hookin (1) - 2 freq howdin (1) - 1 freq chowkin (1) - 1 freq howking (1) - 2 freq howpin (1) - 45 freq howkan (1) - 2 freq howein (1) - 1 freq honkin (1) - 27 freq shockin (2) - 19 freq cowrin (2) - 5 freq hopin (2) - 85 freq |
howkin (0) - 59 freq howkan (1) - 2 freq hawkin (1) - 3 freq howdin (2) - 1 freq hookin (2) - 2 freq hockin (2) - 4 freq chowkin (2) - 1 freq howking (2) - 2 freq honkin (2) - 27 freq howein (2) - 1 freq hoakin (2) - 1 freq howpin (2) - 45 freq howlin (2) - 57 freq cowkin (2) - 2 freq kowkin (2) - 1 freq powkin (2) - 24 freq howkit (2) - 29 freq howrkin (2) - 1 freq howfin (2) - 5 freq gowkin (2) - 2 freq hokin (2) - 11 freq fowkin (2) - 1 freq hawdin (3) - 8 freq harkin (3) - 5 freq hawkins (3) - 3 freq |
SoundEx code - H250 heezin - 33 freq hisna - 28 freq hookin - 2 freq hykin - 1 freq husnae - 32 freq heizin - 15 freq howkin - 59 freq haesna - 53 freq haakon - 3 freq hasna - 29 freq hoggin - 2 freq hissin - 10 freq hisnae - 41 freq hiznae - 1 freq hasnae - 43 freq hashin - 2 freq heuchin - 1 freq hoachin - 21 freq hoosin - 19 freq haesnae - 16 freq hawkin - 3 freq hygiene - 8 freq hackin - 7 freq huchin - 1 freq huggin - 9 freq howieson - 2 freq hessian - 2 freq hissen - 1 freq hickin' - 1 freq heisan - 1 freq howkan - 2 freq hacin - 2 freq hokin - 11 freq hoochin - 2 freq hishin - 1 freq haes'nae - 1 freq hockin - 4 freq hushin - 1 freq haaken' - 1 freq hocken - 1 freq hooseen - 1 freq hizin - 7 freq 'hooshin - 2 freq hooshin - 1 freq hishan - 1 freq hixan - 1 freq hikin - 1 freq hooseen- - 1 freq hissan - 1 freq haikin - 8 freq hajany - 1 freq housin - 5 freq hesnae - 1 freq haekin - 1 freq hesna - 12 freq hosanna - 2 freq hechin - 3 freq hsuan - 1 freq haggin' - 1 freq houchin - 1 freq hookem - 1 freq hassan - 1 freq hussein - 1 freq hasn - 3 freq hissin' - 1 freq hasni - 1 freq hsun - 2 freq hsin - 3 freq €œhsien - 8 freq hsien - 219 freq hausin - 2 freq hoakin - 1 freq haggin - 3 freq hackney - 2 freq hacquenee - 1 freq heejun - 1 freq houghin - 1 freq husna - 1 freq hoosin' - 2 freq husny - 2 freq hcen - 1 freq hhsm - 1 freq huggan - 2 freq hesni - 1 freq hqynu - 1 freq higuian - 1 freq hzqnn - 1 freq hussain - 2 freq his'nae - 1 freq hxn - 1 freq husney - 1 freq hausna - 1 freq heughan - 1 freq hccm - 1 freq heazin - 1 freq hogan - 1 freq hujn - 1 freq heyjimmy - 1 freq 'hoachin' - 1 freq hexham - 1 freq |
MetaPhone code - HKN hookin - 2 freq howkin - 59 freq haakon - 3 freq hoggin - 2 freq hawkin - 3 freq hackin - 7 freq huggin - 9 freq hickin' - 1 freq howkan - 2 freq hokin - 11 freq hockin - 4 freq haaken' - 1 freq hocken - 1 freq hikin - 1 freq haikin - 8 freq haekin - 1 freq haggin' - 1 freq hoakin - 1 freq haggin - 3 freq hackney - 2 freq huggan - 2 freq higuian - 1 freq hogan - 1 freq |
HOWKIN |
| Time to execute Levenshtein function - 0.201534 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.515437 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.027694 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.066825 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.000910 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. |