| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fickleskittle (0) - 1 freq lickspittle (4) - 4 freq lick-spittle (4) - 2 freq lickspittles (5) - 2 freq no-sae-kittle (6) - 1 freq fickles (6) - 1 freq birderkettle (6) - 1 freq filskit (6) - 3 freq ficklie (6) - 2 freq folkestone (7) - 1 freq flexible (7) - 7 freq cleikit (7) - 12 freq clespit (7) - 3 freq facsimile (7) - 2 freq muckle-scale (7) - 1 freq ricketie (7) - 3 freq flettie (7) - 1 freq milestene (7) - 1 freq nickerit (7) - 1 freq fleckit (7) - 3 freq fickle (7) - 11 freq 'little (7) - 1 freq chestitie (7) - 1 freq fliskit (7) - 3 freq meiklewartle (7) - 1 freq |
fickleskittle (0) - 1 freq lickspittle (7) - 4 freq lick-spittle (7) - 2 freq lickspittles (9) - 2 freq fickles (10) - 1 freq filskit (10) - 3 freq fuckinshit (11) - 1 freq nicolashatton (11) - 1 freq back-sitter (11) - 1 freq celestal (11) - 1 freq mucklest (11) - 8 freq facilitate (11) - 9 freq fliskit (11) - 3 freq feckless (11) - 14 freq skuttle (11) - 3 freq fickelt (11) - 4 freq ficklie (11) - 2 freq birderkettle (11) - 1 freq no-sae-kittle (11) - 1 freq filsket (11) - 1 freq ocklester (11) - 1 freq celestial (11) - 4 freq forjeskit (12) - 5 freq chittle (12) - 1 freq facilitated (12) - 3 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 - FKLSKTL fickleskittle - 1 freq |
FICKLESKITTLE |
| Time to execute Levenshtein function - 0.324124 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.517457 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.030152 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.039551 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.000949 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. |