Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hoachin (0) - 19 freq houchin (1) - 1 freq poachin (1) - 5 freq coachin (1) - 1 freq hotchin (1) - 12 freq hoaching (1) - 1 freq hoochin (1) - 2 freq hoatchin (1) - 9 freq laachin (2) - 27 freq houghin (2) - 1 freq hotchit (2) - 1 freq bachin (2) - 2 freq gowchin (2) - 1 freq bowchin (2) - 1 freq hooshin (2) - 1 freq hashin (2) - 2 freq hanchin (2) - 1 freq hackin (2) - 7 freq hootchin (2) - 4 freq machin (2) - 1 freq beachin (2) - 1 freq hoardin (2) - 6 freq hoakin (2) - 1 freq hitchin (2) - 1 freq hoastin (2) - 18 freq |
hoachin (0) - 19 freq houchin (1) - 1 freq hoochin (1) - 2 freq hoatchin (2) - 9 freq heuchin (2) - 1 freq huchin (2) - 1 freq hechin (2) - 3 freq hoaching (2) - 1 freq coachin (2) - 1 freq poachin (2) - 5 freq hotchin (2) - 12 freq hatchin (3) - 5 freq achin (3) - 14 freq hurchin (3) - 11 freq teachin (3) - 160 freq hoach (3) - 1 freq lachin (3) - 46 freq soochin (3) - 1 freq touchin (3) - 46 freq reachin (3) - 32 freq yowchin (3) - 1 freq moochin (3) - 4 freq imachin (3) - 1 freq waachin (3) - 1 freq hockin (3) - 4 freq |
SoundEx code - H250 heezin - 32 freq hisna - 28 freq hookin - 2 freq hykin - 1 freq husnae - 29 freq heizin - 15 freq howkin - 58 freq haesna - 53 freq haakon - 3 freq hasna - 29 freq hoggin - 2 freq hissin - 10 freq hisnae - 41 freq hiznae - 1 freq hasnae - 41 freq hashin - 2 freq heuchin - 1 freq hoachin - 19 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 - HXN hatchin - 5 freq hoatchin - 9 freq hashin - 2 freq heuchin - 1 freq hoachin - 19 freq huchin - 1 freq hotchin - 12 freq hootchin - 4 freq hutcheon - 2 freq hoochin - 2 freq hishin - 1 freq hushin - 1 freq 'hooshin - 2 freq hooshin - 1 freq hishan - 1 freq hatchan - 1 freq hechin - 3 freq houchin - 1 freq hitchin - 1 freq 'hoachin' - 1 freq |
HOACHIN |
Time to execute Levenshtein function - 0.220487 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.406690 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.028433 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.042419 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.000834 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. |