| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunnin (0) - 1 freq haunnil (1) - 1 freq maunnin (1) - 1 freq haunnlin (1) - 1 freq hauntin (1) - 4 freq haundin (1) - 18 freq haunnit (1) - 2 freq haunlin (1) - 5 freq haunin (1) - 7 freq hannin (1) - 3 freq sauntin (2) - 1 freq pannin (2) - 2 freq hauddin (2) - 2 freq sunnin (2) - 5 freq hauflin (2) - 13 freq hannlin (2) - 26 freq chauntin (2) - 3 freq lannin (2) - 2 freq mannin (2) - 1 freq caunnil (2) - 1 freq bannin (2) - 5 freq brunnin (2) - 1 freq hauntan (2) - 1 freq fannin (2) - 9 freq haanin (2) - 1 freq |
haunnin (0) - 1 freq hannin (1) - 3 freq maunnin (2) - 1 freq haunnil (2) - 1 freq hnnin (2) - 1 freq haunlin (2) - 5 freq haunin (2) - 7 freq hauntin (2) - 4 freq haunnlin (2) - 1 freq haunnit (2) - 2 freq haundin (2) - 18 freq hannie (3) - 3 freq hunsin (3) - 3 freq hunkin (3) - 1 freq houndin (3) - 2 freq haunnle (3) - 7 freq runnin (3) - 214 freq vannin (3) - 1 freq haandin (3) - 1 freq cannin (3) - 3 freq lunnin (3) - 1 freq cunnin (3) - 6 freq huntin (3) - 66 freq handin (3) - 15 freq hinnyin (3) - 1 freq |
SoundEx code - H550 human - 315 freq hammin - 1 freq hummin - 18 freq haman - 1 freq haanin - 1 freq humane - 4 freq hainin - 20 freq henman - 1 freq hannin - 3 freq hömin - 2 freq hnnin - 1 freq haunin - 7 freq hinnyin - 1 freq hynin - 1 freq hümin - 1 freq hieweyman - 1 freq haunnin - 1 freq he-man - 1 freq honin - 2 freq hymen - 3 freq €˜hymen - 1 freq himminÂ’ - 1 freq himmin' - 5 freq himmin - 4 freq himm'in - 1 freq hummin' - 1 freq |
MetaPhone code - HNN haanin - 1 freq hainin - 20 freq hannin - 3 freq haunin - 7 freq haunnin - 1 freq honin - 2 freq |
HAUNNIN |
| Time to execute Levenshtein function - 0.202626 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.336225 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.033400 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.037117 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.000780 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. |