Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fickles (0) - 1 freq rickles (1) - 3 freq pickles (1) - 2 freq tickles (1) - 5 freq fickle (1) - 11 freq fankles (2) - 4 freq files (2) - 108 freq puckles (2) - 14 freq feckle (2) - 2 freq fiedles (2) - 2 freq tickler (2) - 4 freq ficklie (2) - 2 freq hickled (2) - 1 freq rickled (2) - 1 freq yackles (2) - 1 freq huckles (2) - 1 freq freckles (2) - 17 freq nicoles (2) - 1 freq tickled (2) - 8 freq feckless (2) - 14 freq buckles (2) - 1 freq pickled (2) - 10 freq keckles (2) - 2 freq rickle (2) - 31 freq mickle (2) - 13 freq |
fickles (0) - 1 freq tickles (2) - 5 freq fickle (2) - 11 freq rickles (2) - 3 freq pickles (2) - 2 freq ruckles (3) - 1 freq huckles (3) - 1 freq cockles (3) - 6 freq freckles (3) - 17 freq keckles (3) - 2 freq tackles (3) - 3 freq yackles (3) - 1 freq buckles (3) - 1 freq feckless (3) - 14 freq ficklie (3) - 2 freq puckles (3) - 14 freq fanckles (3) - 1 freq fankles (3) - 4 freq feckle (3) - 2 freq kuckles (3) - 1 freq muckles (3) - 1 freq cackles (3) - 1 freq hackles (3) - 3 freq focks (4) - 7 freq tickle (4) - 12 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 |
FICKLES |
Time to execute Levenshtein function - 0.197645 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.342932 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.029348 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.041503 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.001076 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. |