| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-fascination (0) - 1 freq fascination (5) - 7 freq hallucination (6) - 3 freq fescination (6) - 1 freq fascinatin (6) - 16 freq assassination (6) - 6 freq hauf-lauchin (7) - 1 freq assassinations (7) - 2 freq fescinatin (7) - 1 freq hauf-a-croon (7) - 1 freq deracination (7) - 1 freq fascinating (7) - 6 freq suffocation (7) - 1 freq hauf-fancied (7) - 1 freq hauf-lachin (7) - 1 freq hallucinatin (7) - 2 freq affectation (7) - 4 freq vaccination (7) - 1 freq fascinatan (7) - 1 freq procrastination (7) - 3 freq fascinatit (7) - 4 freq hauf-souchin (8) - 1 freq haaf-familiar (8) - 1 freq association (8) - 44 freq aforestation (8) - 1 freq |
hauf-fascination (0) - 1 freq fascination (8) - 7 freq fescination (9) - 1 freq fascinatin (9) - 16 freq fescinatin (10) - 1 freq hallucination (10) - 3 freq fascinatan (10) - 1 freq affectation (11) - 4 freq fascinatit (11) - 4 freq hauf-decent (11) - 1 freq hauf-spent (11) - 1 freq hauf-lachin (11) - 1 freq hauf-souchin (11) - 1 freq hallucinatin (11) - 2 freq hauf-a-croon (11) - 1 freq hauf-fancied (11) - 1 freq hauf-lauchin (11) - 1 freq fascinating (11) - 6 freq suffocation (11) - 1 freq assassination (11) - 6 freq hauf-mast (12) - 3 freq hauf-wushin (12) - 1 freq hauf-turnin (12) - 2 freq hauf-past (12) - 7 freq half-listenin (12) - 1 freq |
SoundEx code - H125 heepocondria - 1 freq heepchondreeoch - 1 freq hauf-smile - 3 freq hauf-smoorin - 1 freq havisham - 1 freq hauf-fascination - 1 freq hauf-centurie - 1 freq hopkins - 4 freq hauf-wushin - 1 freq hip-jynt - 2 freq hypochondriak - 1 freq hypochondriac - 4 freq hauf-sindèrie - 1 freq hauf-conscious - 1 freq hauf-smilet - 1 freq hibscentral - 1 freq hwpznj - 1 freq hopkinsbrfc - 1 freq |
MetaPhone code - HFFSNXN hauf-fascination - 1 freq |
HAUF-FASCINATION |
| Time to execute Levenshtein function - 0.406853 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.692534 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.029405 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.091595 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.000871 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. |