| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ilcky (0) - 2 freq ilky (1) - 61 freq ilk (2) - 317 freq lecky (2) - 5 freq ilkg (2) - 1 freq inky (2) - 8 freq iiky (2) - 1 freq becky (2) - 3 freq picky (2) - 7 freq milky (2) - 21 freq i'sky (2) - 4 freq vicky (2) - 15 freq ilke (2) - 2 freq pocky (2) - 2 freq ecky (2) - 9 freq ticky (2) - 2 freq cocky (2) - 12 freq micky (2) - 3 freq mucky (2) - 3 freq jocky (2) - 25 freq icey (2) - 3 freq silky (2) - 10 freq lckl (2) - 1 freq itchy (2) - 36 freq ilk' (2) - 1 freq |
ilcky (0) - 2 freq lucky (2) - 273 freq licky (2) - 1 freq lacky (2) - 1 freq lecky (2) - 5 freq ilky (2) - 61 freq alck (2) - 1 freq bucky (3) - 15 freq lock (3) - 156 freq luck (3) - 327 freq alchy (3) - 3 freq rocky (3) - 21 freq lack (3) - 137 freq blck (3) - 1 freq aleck (3) - 2 freq nocky (3) - 1 freq ricky (3) - 7 freq ilc (3) - 1 freq jacky (3) - 1 freq tucky (3) - 12 freq olick (3) - 1 freq alick (3) - 1 freq leck (3) - 27 freq hecky (3) - 14 freq eleck (3) - 4 freq |
SoundEx code - I420 ilka - 887 freq ilk - 317 freq ilky - 61 freq 'ilka - 4 freq ill-less - 1 freq ills - 36 freq ilkka - 1 freq -ilka - 1 freq iools - 1 freq iles - 3 freq ill-luck - 2 freq iyl-ies - 1 freq ilse - 1 freq ilkie - 92 freq ilkg - 1 freq ill-laek - 2 freq ill-lik - 1 freq ilk' - 1 freq i'holes - 1 freq i'lug - 1 freq ilkae - 4 freq iolaus - 6 freq ill-yaise - 1 freq 'ilk - 1 freq ils - 1 freq ilks - 1 freq ilke - 2 freq ill's - 1 freq ill-luk - 1 freq €œilka - 1 freq iyillies - 1 freq ilc - 1 freq ilcky - 2 freq |
MetaPhone code - ILK ilka - 887 freq ilk - 317 freq ilky - 61 freq 'ilka - 4 freq ilkka - 1 freq -ilka - 1 freq ilkie - 92 freq ilk' - 1 freq i'lug - 1 freq ilkae - 4 freq 'ilk - 1 freq ilke - 2 freq €œilka - 1 freq ilc - 1 freq ilcky - 2 freq |
ILCKY |
| Time to execute Levenshtein function - 0.227057 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.346753 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.028954 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.038786 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.000872 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. |