Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ilse (0) - 1 freq ilie (1) - 1 freq ils (1) - 1 freq ise (1) - 2 freq ile (1) - 65 freq else (1) - 743 freq alse (1) - 8 freq ilve (1) - 1 freq i'se (1) - 27 freq ilke (1) - 2 freq eilse (1) - 1 freq idle (2) - 27 freq halse (2) - 1 freq rile (2) - 3 freq blee (2) - 2 freq ite (2) - 3 freq uise (2) - 281 freq ihe (2) - 2 freq glie (2) - 1 freq itae (2) - 10 freq ike (2) - 3 freq its' (2) - 2 freq filie (2) - 19 freq loe (2) - 15 freq iss- (2) - 1 freq |
ilse (0) - 1 freq eilse (1) - 1 freq alse (1) - 8 freq ils (1) - 1 freq else (1) - 743 freq ails (2) - 9 freq els (2) - 11 freq also (2) - 324 freq als (2) - 27 freq lose (2) - 100 freq iles (2) - 3 freq olso (2) - 1 freq ls (2) - 6 freq ailsa (2) - 32 freq elsie (2) - 62 freq alsae (2) - 9 freq elise (2) - 1 freq oils (2) - 2 freq ile (2) - 65 freq ilve (2) - 1 freq alsa (2) - 1 freq ilke (2) - 2 freq ise (2) - 2 freq i'se (2) - 27 freq ilie (2) - 1 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 - ILS ills - 36 freq iools - 1 freq iles - 3 freq iyl-ies - 1 freq ilse - 1 freq iolaus - 6 freq ils - 1 freq ill's - 1 freq |
ILSE |
Time to execute Levenshtein function - 0.289402 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.531512 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.058436 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.039560 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.000899 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. |