| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feckless (0) - 14 freq seckless (1) - 1 freq reckless (1) - 2 freq fekless (1) - 1 freq hecklers (2) - 1 freq fickles (2) - 1 freq rackless (2) - 1 freq reekless (2) - 1 freq keckles (2) - 2 freq luckless (2) - 2 freq feckers (2) - 7 freq fendless (2) - 1 freq faceless (2) - 5 freq backless (2) - 1 freq feckle (2) - 2 freq sackless (2) - 1 freq freckles (2) - 17 freq fearless (2) - 9 freq skecklers (3) - 1 freq fireless (3) - 3 freq cockles (3) - 6 freq teenless (3) - 1 freq merciless (3) - 7 freq feekies (3) - 2 freq pickles (3) - 2 freq |
feckless (0) - 14 freq reckless (2) - 2 freq fekless (2) - 1 freq seckless (2) - 1 freq faceless (3) - 5 freq backless (3) - 1 freq luckless (3) - 2 freq sackless (3) - 1 freq rackless (3) - 1 freq fickles (3) - 1 freq freckles (4) - 17 freq fearless (4) - 9 freq keckles (4) - 2 freq feckers (4) - 7 freq feckle (4) - 2 freq fendless (4) - 1 freq reekless (4) - 1 freq hecklers (4) - 1 freq tickles (5) - 5 freq flawless (5) - 3 freq kless (5) - 1 freq fankles (5) - 4 freq puckles (5) - 14 freq fecks (5) - 3 freq huckles (5) - 1 freq |
SoundEx code - F242 feckless - 14 freq fossils - 9 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 - FKLS feckless - 14 freq fekless - 1 freq fickles - 1 freq |
FECKLESS |
| Time to execute Levenshtein function - 0.364423 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.526409 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.063381 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.038132 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.000874 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. |