| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fameeliars (0) - 1 freq fameeliar (1) - 19 freq fameiliar (2) - 11 freq familiars (2) - 1 freq unfameeliar (3) - 1 freq fameelyer (3) - 1 freq familiar (3) - 73 freq famíliar (3) - 1 freq faceelities (4) - 3 freq feelans (4) - 2 freq meelers (4) - 1 freq faceelity (4) - 1 freq amelia (4) - 1 freq oonfameeliar (4) - 1 freq familiarly (4) - 1 freq faelyirs (4) - 1 freq feelings (4) - 19 freq fameiliarity (4) - 1 freq feelins (4) - 76 freq gammeldans (4) - 1 freq jameela (4) - 2 freq fankelites (4) - 4 freq feelies (4) - 1 freq 'familiar (4) - 2 freq families (4) - 30 freq |
fameeliars (0) - 1 freq fameeliar (2) - 19 freq familiars (2) - 1 freq fameiliar (3) - 11 freq familiar (4) - 73 freq fameelyer (4) - 1 freq familiarly (5) - 1 freq feelers (5) - 1 freq feelurs (5) - 1 freq meelers (5) - 1 freq families (5) - 30 freq unfameeliar (5) - 1 freq faelyirs (5) - 1 freq fameiliarity (5) - 1 freq faimlies (6) - 47 freq femmelies (6) - 1 freq hamelins (6) - 1 freq femlies (6) - 2 freq faimlie's (6) - 1 freq faimilies (6) - 43 freq fleers (6) - 1 freq family's (6) - 3 freq familial (6) - 2 freq 'familiar (6) - 2 freq feelans (6) - 2 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 - FMLRS fameeliars - 1 freq familiars - 1 freq |
FAMEELIARS |
| Time to execute Levenshtein function - 0.248026 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.420007 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.028993 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.038942 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.000965 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. |