| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-fameeliar (0) - 1 freq half-fameeliar (1) - 1 freq haaf-familiar (3) - 1 freq unfameeliar (4) - 1 freq fameeliar (5) - 19 freq hauf-a-meenit (5) - 1 freq oonfameeliar (5) - 1 freq hauf-feart (6) - 2 freq fameeliars (6) - 1 freq fameiliar (6) - 11 freq hauf-greetin (6) - 1 freq hauf-fancied (6) - 1 freq hauf-meisur (6) - 1 freq unfamiliar (6) - 10 freq familiar (7) - 73 freq hauf-smilet (7) - 1 freq hauf-leeved (7) - 1 freq hauf-murderin (7) - 1 freq half-fairt (7) - 1 freq hauf-human (7) - 1 freq famíliar (7) - 1 freq hauf-gates (7) - 1 freq hauf-mirk (7) - 1 freq hauf-a-mile (7) - 1 freq hauf-smile (7) - 3 freq |
hauf-fameeliar (0) - 1 freq half-fameeliar (2) - 1 freq haaf-familiar (3) - 1 freq unfameeliar (7) - 1 freq oonfameeliar (8) - 1 freq hauf-a-meenit (8) - 1 freq hauf-meisur (8) - 1 freq fameeliar (8) - 19 freq unfamiliar (9) - 10 freq hauf-a-mile (9) - 1 freq hauf-smile (9) - 3 freq hauf-smilet (9) - 1 freq hauf-feart (9) - 2 freq fameiliar (9) - 11 freq hauf-fancied (9) - 1 freq hauf-time (10) - 1 freq hauf-mad (10) - 1 freq hauf-aware (10) - 1 freq hauf-sister (10) - 3 freq hauf-an-oor (10) - 4 freq hauf-muin (10) - 1 freq fameelyer (10) - 1 freq hauf-bauld (10) - 1 freq hauf-asleep (10) - 4 freq hauf-mete (10) - 1 freq |
SoundEx code - H154 heivenlie - 8 freq heivenly - 6 freq hippin'll - 1 freq heavenly - 8 freq hauf-a-mile - 1 freq hauf-fameeliar - 1 freq haivenlie - 2 freq hivvenly - 6 freq heevinly - 2 freq heevenly - 1 freq hevinly - 1 freq haaf-familiar - 1 freq hobnail - 2 freq heavenlydancer - 2 freq heavenlydancers - 2 freq hbmyhl - 1 freq heavenlyink - 2 freq |
MetaPhone code - HFFMLR hauf-fameeliar - 1 freq haaf-familiar - 1 freq |
HAUF-FAMEELIAR |
| Time to execute Levenshtein function - 0.238965 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.410276 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.028578 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.038597 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.000949 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. |