| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fklechs (0) - 1 freq flechs (1) - 8 freq flecks (2) - 4 freq keechs (2) - 1 freq flechy (2) - 2 freq fechs (2) - 1 freq flech' (2) - 1 freq fleechs (2) - 1 freq flech (2) - 8 freq kechs (2) - 1 freq flects (2) - 1 freq seechs (3) - 1 freq kecks (3) - 5 freq flocks (3) - 10 freq fleurs (3) - 2 freq fech (3) - 1 freq blecks (3) - 3 freq fleps (3) - 1 freq kletts (3) - 1 freq fleeces (3) - 8 freq fleeches (3) - 2 freq keech (3) - 43 freq fleechd (3) - 1 freq feech (3) - 1 freq files (3) - 111 freq |
fklechs (0) - 1 freq flechs (2) - 8 freq fleechs (3) - 1 freq flech (4) - 8 freq flects (4) - 1 freq fleeches (4) - 2 freq kechs (4) - 1 freq flech' (4) - 1 freq flecks (4) - 4 freq keechs (4) - 1 freq fechs (4) - 1 freq flechy (4) - 2 freq flenches (5) - 2 freq filch (5) - 1 freq golachs (5) - 2 freq ablachs (5) - 2 freq cleuchs (5) - 5 freq faachs (5) - 1 freq luchs (5) - 1 freq lachs (5) - 3 freq flechan (5) - 1 freq flechin (5) - 1 freq fleecht (5) - 3 freq skreichs (5) - 7 freq fliche (5) - 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 - FKLXS fklechs - 1 freq |
FKLECHS |
| Time to execute Levenshtein function - 0.394276 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.577037 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.028339 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.073184 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.000885 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. |