| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunin (0) - 7 freq haunlin (1) - 5 freq haanin (1) - 1 freq haunnin (1) - 1 freq launin (1) - 1 freq haundin (1) - 18 freq haunil (1) - 1 freq hannin (1) - 3 freq haunit (1) - 2 freq hausin (1) - 2 freq hauntin (1) - 4 freq hainin (1) - 20 freq haulin (1) - 19 freq haudin (1) - 374 freq hairin (2) - 3 freq laupin (2) - 2 freq hammin (2) - 1 freq haalin (2) - 9 freq yarnin (2) - 18 freq halpin (2) - 5 freq huntin (2) - 66 freq hawdin (2) - 8 freq haulen (2) - 10 freq hainins (2) - 1 freq chauncin (2) - 1 freq |
haunin (0) - 7 freq hainin (1) - 20 freq haanin (1) - 1 freq haulin (2) - 19 freq haudin (2) - 374 freq hynin (2) - 1 freq hannie (2) - 3 freq hauntin (2) - 4 freq hann (2) - 23 freq honin (2) - 2 freq haunlin (2) - 5 freq haundin (2) - 18 freq haunnin (2) - 1 freq hausin (2) - 2 freq launin (2) - 1 freq hannin (2) - 3 freq haunit (2) - 2 freq haunil (2) - 1 freq bounin (3) - 1 freq havin (3) - 67 freq haunt (3) - 28 freq haunel (3) - 3 freq houlin (3) - 21 freq haunnil (3) - 1 freq haikin (3) - 8 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 |
HAUNIN |
| Time to execute Levenshtein function - 0.211227 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.349754 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.028367 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.037330 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.000849 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. |