| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haaf-familiar (0) - 1 freq half-fameeliar (3) - 1 freq hauf-fameeliar (3) - 1 freq familiar (5) - 73 freq unfamiliar (5) - 10 freq awdlyfamiliar (5) - 1 freq 'familiar (5) - 2 freq familiars (6) - 1 freq haaf-five (6) - 1 freq hauf-fancied (6) - 1 freq half-mile (6) - 1 freq hauf-a-mile (6) - 1 freq half-smile (6) - 1 freq half-fill (6) - 1 freq familial (6) - 2 freq half-fairt (6) - 1 freq hauf-smile (6) - 3 freq fameiliar (6) - 11 freq unfamilar (6) - 1 freq hauf-smilet (6) - 1 freq haaf-tirrt (7) - 1 freq hame-farin (7) - 1 freq haafgaits (7) - 1 freq maximilian (7) - 1 freq familie (7) - 1 freq |
haaf-familiar (0) - 1 freq hauf-fameeliar (3) - 1 freq half-fameeliar (4) - 1 freq hauf-a-mile (8) - 1 freq hauf-smile (8) - 3 freq 'familiar (8) - 2 freq hauf-smilet (8) - 1 freq awdlyfamiliar (8) - 1 freq unfamiliar (8) - 10 freq familiar (8) - 73 freq unfamilar (9) - 1 freq hauf-meisur (9) - 1 freq half-fill (9) - 1 freq fameiliar (9) - 11 freq hauf-fancied (9) - 1 freq haaf-five (9) - 1 freq half-mile (9) - 1 freq half-smile (9) - 1 freq oonfameeliar (10) - 1 freq hauf-aware (10) - 1 freq hauf-bauld (10) - 1 freq hauf-mad (10) - 1 freq hauf-feart (10) - 2 freq hauf-lit (10) - 4 freq hauf-an-hour (10) - 2 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 |
HAAF-FAMILIAR |
| Time to execute Levenshtein function - 0.202309 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.489886 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.029115 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.038726 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.001181 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. |