| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-luck (0) - 2 freq ill-luk (1) - 1 freq ill-laek (2) - 2 freq ill-lik (2) - 1 freq ill-luckit (2) - 4 freq ill-wul (3) - 1 freq ill-fun (3) - 1 freq ill-turn (3) - 1 freq ill-place (3) - 2 freq ill-luikin (3) - 1 freq ill-wull (3) - 5 freq ill-less (3) - 1 freq illluckit (3) - 1 freq ill-plece (3) - 1 freq ill-spak (3) - 2 freq hillock (4) - 8 freq blu-tack (4) - 1 freq ull-wull (4) - 2 freq ill-lookin (4) - 3 freq ill-bred (4) - 2 freq misluck (4) - 3 freq ill-ddin (4) - 1 freq luck (4) - 318 freq alleluia (4) - 2 freq ill-best (4) - 1 freq |
ill-luck (0) - 2 freq ill-luk (2) - 1 freq ill-luckit (3) - 4 freq ill-lik (3) - 1 freq ill-laek (3) - 2 freq ill-luikin (5) - 1 freq ill-place (5) - 2 freq ill-spak (5) - 2 freq ill-less (5) - 1 freq ill-plece (5) - 1 freq illluckit (5) - 1 freq selleck (6) - 1 freq willock (6) - 1 freq sillock (6) - 2 freq di-a-lack (6) - 2 freq colleck (6) - 11 freq coll-black (6) - 1 freq ill-likit (6) - 1 freq bullock (6) - 3 freq gullock (6) - 3 freq bollick (6) - 2 freq bet-lick (6) - 1 freq pollock (6) - 3 freq ill-lookin (6) - 3 freq ill-turn (6) - 1 freq |
SoundEx code - I420 ilka - 865 freq ilk - 317 freq ilky - 61 freq 'ilka - 4 freq ill-less - 1 freq ills - 35 freq ilkka - 1 freq -ilka - 1 freq iools - 1 freq iles - 3 freq ill-luck - 2 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 - ILLK ill-luck - 2 freq ill-laek - 2 freq ill-lik - 1 freq ill-luk - 1 freq |
ILL-LUCK |
| Time to execute Levenshtein function - 0.219979 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.367485 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.027272 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.040085 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.000830 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. |