| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facials (0) - 2 freq facial (1) - 18 freq facile (2) - 2 freq socials (2) - 3 freq faals (2) - 1 freq fails (2) - 20 freq jackals (2) - 1 freq racial (2) - 14 freq fabils (2) - 2 freq faills (2) - 1 freq facies (2) - 1 freq faa's (3) - 7 freq facts (3) - 46 freq animals (3) - 112 freq factions (3) - 1 freq cabals (3) - 4 freq coals (3) - 18 freq facks (3) - 15 freq family (3) - 329 freq farins (3) - 1 freq wails (3) - 6 freq farcical (3) - 2 freq acis (3) - 3 freq asians (3) - 4 freq glacial (3) - 2 freq |
facials (0) - 2 freq facial (2) - 18 freq faills (3) - 1 freq facies (3) - 1 freq fails (3) - 20 freq fabils (3) - 2 freq socials (3) - 3 freq faals (3) - 1 freq facile (3) - 2 freq farls (4) - 5 freq facades (4) - 2 freq officials (4) - 5 freq caals (4) - 2 freq faces (4) - 230 freq finals (4) - 7 freq locals (4) - 39 freq fiels (4) - 23 freq face's (4) - 1 freq facets (4) - 2 freq fooils (4) - 1 freq facees (4) - 1 freq faels (4) - 1 freq fills (4) - 36 freq focal (4) - 2 freq fals (4) - 1 freq |
SoundEx code - F242 feckless - 14 freq fossils - 10 freq fussles - 1 freq facials - 2 freq facelessness - 1 freq faceless - 5 freq fossilised - 2 freq fekless - 1 freq fklechs - 1 freq fushlochs - 1 freq fickles - 1 freq fecollege - 1 freq feglczk - 1 freq fickleskittle - 1 freq |
MetaPhone code - FXLS facials - 2 freq veshels - 2 freq |
FACIALS |
| Time to execute Levenshtein function - 0.322547 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.579203 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.029447 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.079059 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.001125 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. |