| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fallicies (0) - 1 freq follicles (2) - 1 freq rallies (3) - 7 freq nullifies (3) - 1 freq facilities (3) - 22 freq galleries (3) - 8 freq hallies (3) - 1 freq failzies (3) - 1 freq vallies (3) - 1 freq follies (3) - 8 freq fallaes (3) - 1 freq wallies (3) - 16 freq facies (3) - 1 freq dallies (3) - 5 freq tallies (3) - 1 freq families (3) - 30 freq sallies (3) - 3 freq fairies (3) - 39 freq policies (3) - 46 freq mallies (3) - 1 freq allies (3) - 8 freq faimilies (3) - 43 freq fancies (3) - 27 freq facie (4) - 5 freq flaggies (4) - 3 freq |
fallicies (0) - 1 freq follicles (3) - 1 freq fallaes (4) - 1 freq follies (4) - 8 freq follaes (5) - 58 freq fillims (5) - 2 freq faimilies (5) - 43 freq mallies (5) - 1 freq allies (5) - 8 freq fancies (5) - 27 freq follicly (5) - 1 freq fillins (5) - 2 freq fleeces (5) - 8 freq fallows (5) - 1 freq falls (5) - 15 freq fallacy (5) - 1 freq fellaes (5) - 9 freq policies (5) - 46 freq folloes (5) - 1 freq failzies (5) - 1 freq rallies (5) - 7 freq wallies (5) - 16 freq hallies (5) - 1 freq nullifies (5) - 1 freq facilities (5) - 22 freq |
SoundEx code - F422 flakes - 20 freq flashes - 24 freq flushes - 7 freq flaggies - 3 freq flea-heuchs - 1 freq fleeces - 8 freq flughic - 1 freq flech-champit - 1 freq folkies - 4 freq fleechs - 1 freq flechs - 8 freq fleshes - 1 freq flaccus - 1 freq fowlsheugh's - 1 freq fleeches - 2 freq flaesocks - 1 freq flaesoks - 1 freq failzies - 1 freq flezicks - 1 freq fallicies - 1 freq foulkes - 4 freq flzeys - 1 freq folkestone - 1 freq fliskies - 1 freq |
MetaPhone code - FLSS fleeces - 8 freq floss's - 1 freq failzies - 1 freq fallicies - 1 freq vlisses - 2 freq vlzs - 1 freq flzeys - 1 freq |
FALLICIES |
| Time to execute Levenshtein function - 0.205754 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.359818 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.028103 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.042833 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.000939 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. |