| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| happan (0) - 2 freq hapnan (1) - 2 freq happen (1) - 386 freq gappan (1) - 1 freq happin (1) - 16 freq shappan (1) - 1 freq lappan (1) - 1 freq yappan (1) - 1 freq chappan (1) - 5 freq tappan (1) - 3 freq haadan (2) - 2 freq haalan (2) - 2 freq halpin (2) - 5 freq hippin (2) - 1 freq happed (2) - 35 freq shappin (2) - 5 freq shoppan (2) - 1 freq gappas (2) - 2 freq happint (2) - 15 freq drappan (2) - 1 freq haean (2) - 12 freq moppan (2) - 1 freq hadean (2) - 3 freq happie (2) - 13 freq lampan (2) - 1 freq |
happan (0) - 2 freq happen (1) - 386 freq happin (1) - 16 freq hoppin (2) - 11 freq hapnan (2) - 2 freq hippin (2) - 1 freq ehappin (2) - 1 freq tappan (2) - 3 freq heppen (2) - 11 freq heppin (2) - 1 freq shappan (2) - 1 freq chappan (2) - 5 freq lappan (2) - 1 freq yappan (2) - 1 freq gappan (2) - 1 freq nappin (3) - 1 freq chappen (3) - 2 freq pappin (3) - 7 freq helpan (3) - 1 freq happ (3) - 4 freq wappon (3) - 4 freq yappen (3) - 5 freq happins (3) - 3 freq lippan (3) - 1 freq appin (3) - 2 freq |
SoundEx code - H150 heaven - 69 freq happen - 386 freq hivna - 48 freq hivven - 54 freq hopin - 85 freq hivvin - 29 freq hivnae - 42 freq heiven - 109 freq huffin - 7 freq heavin - 18 freq havenae - 20 freq hoppin - 11 freq huvin - 156 freq havin - 73 freq howpin - 45 freq heivin - 12 freq hivvnae - 1 freq huvnae - 61 freq haven - 19 freq ha'penny - 3 freq hevin - 20 freq 'huvin - 1 freq happin - 16 freq haevnae - 1 freq hivan - 7 freq hopan - 6 freq hvamm - 1 freq havn - 2 freq hivin - 27 freq haivn - 1 freq howfin' - 1 freq huvin' - 1 freq hopen - 1 freq huvvin - 5 freq heeeeaaavaaaahnnnn - 1 freq havnae - 23 freq hopin' - 6 freq hoovin - 3 freq howfin - 5 freq hoapin - 2 freq 'heaven - 1 freq hyphen - 2 freq heaven' - 1 freq havana - 1 freq heppen - 11 freq heypen - 3 freq hauf-yin - 10 freq haiven - 34 freq haiven' - 1 freq hivven' - 1 freq heav'n - 1 freq havena - 2 freq haevin - 2 freq hoopin - 5 freq hövin - 2 freq heeven - 12 freq ha'pny - 3 freq havna - 2 freq 'ha'penny - 2 freq hivvan - 10 freq hopein - 1 freq ha'pennie - 1 freq hofn - 4 freq happan - 2 freq haivin - 3 freq haepin - 1 freq heivan - 1 freq hauf-won - 1 freq heapin - 2 freq hevan - 10 freq houpan - 1 freq hevna - 8 freq howpan - 1 freq heevin - 9 freq heefin - 1 freq hüben - 1 freq heven - 1 freq híven - 1 freq haepenny - 1 freq hevn - 1 freq hivny - 1 freq havin' - 1 freq huv'nae - 1 freq huvnea - 1 freq haufpenny - 1 freq huvna - 1 freq hivin' - 1 freq heppin - 1 freq huvane - 1 freq hpny - 1 freq hven - 1 freq hivni - 1 freq hapenny - 2 freq hvun - 1 freq hoban - 5 freq havena' - 1 freq hehyhvnny - 1 freq hippin - 1 freq hav'nae - 1 freq huevon - 1 freq hivenae - 1 freq |
MetaPhone code - HPN happen - 386 freq hopin - 85 freq hoppin - 11 freq howpin - 45 freq ha'penny - 3 freq happin - 16 freq hopan - 6 freq hopen - 1 freq hopin' - 6 freq hoapin - 2 freq heppen - 11 freq heypen - 3 freq hoopin - 5 freq ha'pny - 3 freq 'ha'penny - 2 freq hopein - 1 freq ha'pennie - 1 freq happan - 2 freq haepin - 1 freq heapin - 2 freq houpan - 1 freq howpan - 1 freq haepenny - 1 freq heppin - 1 freq hapenny - 2 freq hippin - 1 freq |
HAPPAN |
| Time to execute Levenshtein function - 0.227624 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.393436 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.029293 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.038222 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.000856 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. |