Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hauf-expeckin (0) - 3 freq unexpeckit (5) - 10 freq expeckin (5) - 21 freq hauf-souchin (5) - 1 freq hauf-apen (5) - 2 freq hauf-lachin (5) - 1 freq uxexpeckit (5) - 1 freq hauf-hopin (5) - 2 freq hauf-lauchin (5) - 1 freq hauf-greetin (5) - 1 freq hauf-chackit (5) - 1 freq hauf-etten (5) - 2 freq hauf-steikit (5) - 2 freq war-exportin (6) - 1 freq hauf-blin (6) - 1 freq tattie-pickin (6) - 1 freq half-open (6) - 1 freq hauf-happit (6) - 2 freq hauf-opened (6) - 1 freq hauf-hertit (6) - 1 freq hauf-wushin (6) - 1 freq hauf-cock (6) - 1 freq oonexpeckit (6) - 2 freq hauf-deid (6) - 8 freq hauf-empty (6) - 1 freq |
hauf-expeckin (0) - 3 freq hauf-lauchin (8) - 1 freq hauf-chackit (8) - 1 freq hauf-hopin (8) - 2 freq hauf-lachin (8) - 1 freq haaf-drucken (8) - 1 freq expeckin (8) - 21 freq hauf-souchin (8) - 1 freq hauf-apen (8) - 2 freq hauf-cock (9) - 1 freq han-pickit (9) - 1 freq hauf-steikit (9) - 2 freq hauf-etten (9) - 2 freq hauf-greetin (9) - 1 freq uxexpeckit (9) - 1 freq unexpeckit (9) - 10 freq hauf-decent (10) - 1 freq expeckit (10) - 31 freq respeckin (10) - 2 freq expectin (10) - 66 freq half-lippenin (10) - 1 freq unsuspeckin (10) - 1 freq hauf-yin (10) - 10 freq hauf-croon (10) - 1 freq hauf-muin (10) - 1 freq |
SoundEx code - H121 hauf-expeckin - 3 freq hauf-whusper - 1 freq heebeegeebees - 1 freq hauf-spent - 1 freq hapsburg - 1 freq hfxfhi - 1 freq hpcbblfb - 1 freq hvxfznxczj - 1 freq hfucva - 1 freq hvxipj - 1 freq hfbkeifdjb - 1 freq hibeesfamily - 18 freq |
MetaPhone code - HFKSPKN hauf-expeckin - 3 freq |
HAUF-EXPECKIN |
Time to execute Levenshtein function - 0.226923 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.391097 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.028070 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.043943 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.001161 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. |