| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fameeliar (0) - 19 freq fameiliar (1) - 11 freq fameeliars (1) - 1 freq unfameeliar (2) - 1 freq familiar (2) - 73 freq famíliar (2) - 1 freq fameelyer (2) - 1 freq familiars (3) - 1 freq jameela (3) - 2 freq 'familiar (3) - 2 freq faceelity (3) - 1 freq oonfameeliar (3) - 1 freq amelia (3) - 1 freq familial (3) - 2 freq hamelan (4) - 1 freq samelike (4) - 2 freq fameiliarity (4) - 1 freq feelin (4) - 497 freq namelie (4) - 3 freq freelie (4) - 3 freq sammillar (4) - 1 freq faemier (4) - 2 freq families (4) - 30 freq feeling (4) - 64 freq jamesinar (4) - 1 freq |
fameeliar (0) - 19 freq fameiliar (1) - 11 freq familiar (2) - 73 freq fameeliars (2) - 1 freq fameelyer (2) - 1 freq unfameeliar (3) - 1 freq familial (4) - 2 freq oonfameeliar (4) - 1 freq 'familiar (4) - 2 freq famíliar (4) - 1 freq familiars (4) - 1 freq smoliar (5) - 1 freq families (5) - 30 freq faemier (5) - 2 freq meeler (5) - 1 freq fellar (5) - 1 freq familiarly (5) - 1 freq fetlar (5) - 9 freq unfamiliar (5) - 10 freq fameiliarity (5) - 1 freq amelia (5) - 1 freq familie (5) - 1 freq faceelity (5) - 1 freq jameela (5) - 2 freq seemlar (6) - 9 freq |
SoundEx code - F546 fameeliar - 19 freq fameeliars - 1 freq familiar - 73 freq fameelyer - 1 freq familiarity - 8 freq familiarising - 1 freq familiarly - 1 freq faimly-run - 1 freq fameiliar - 11 freq 'familiar - 2 freq fameiliarity - 1 freq familiars - 1 freq famíliar - 1 freq |
MetaPhone code - FMLR fameeliar - 19 freq familiar - 73 freq fameiliar - 11 freq 'familiar - 2 freq famíliar - 1 freq |
FAMEELIAR |
| Time to execute Levenshtein function - 0.190732 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.345772 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.027779 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.037092 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.000905 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. |