| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-ane (0) - 1 freq ilk-ane (1) - 1 freq ilk'ane (2) - 6 freq ill-aff (2) - 6 freq ill-end (2) - 1 freq ilkane (2) - 51 freq ill-made (2) - 2 freq i'lane (2) - 1 freq iikane (3) - 1 freq lane (3) - 240 freq plane (3) - 68 freq willnae (3) - 101 freq insane (3) - 8 freq island (3) - 131 freq ill-usage (3) - 1 freq ill-fed (3) - 1 freq illie (3) - 2 freq dillan (3) - 1 freq ice-age (3) - 1 freq killan (3) - 2 freq ileene (3) - 1 freq inane (3) - 2 freq holl-an (3) - 1 freq ill-got (3) - 1 freq hill-man (3) - 1 freq |
ill-ane (0) - 1 freq ilk-ane (2) - 1 freq ill-end (3) - 1 freq uilleann (4) - 1 freq ellan (4) - 2 freq ill-dain (4) - 1 freq ill- (4) - 2 freq ill-omen (4) - 1 freq allan (4) - 91 freq ill-fun (4) - 1 freq ill-teen (4) - 1 freq illumine (4) - 1 freq dial-an (4) - 1 freq ell-wan (4) - 1 freq ill-taen (4) - 2 freq lillian (4) - 1 freq ill-yaise (4) - 1 freq holl-an (4) - 1 freq ilkane (4) - 51 freq ill-aff (4) - 6 freq ill-made (4) - 2 freq i'lane (4) - 1 freq ilk'ane (4) - 6 freq ill-used (5) - 1 freq ill-lik (5) - 1 freq |
SoundEx code - I450 ileum - 1 freq i'lane - 1 freq i'lum - 1 freq i'loon - 1 freq ill-ane - 1 freq ilin - 1 freq ilumme - 6 freq ileene - 1 freq |
MetaPhone code - ILN i'lane - 1 freq i'loon - 1 freq ill-ane - 1 freq ilin - 1 freq ileene - 1 freq |
ILL-ANE |
| Time to execute Levenshtein function - 0.234579 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.393982 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.028273 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.039538 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.000863 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. |