Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ilin (0) - 1 freq iain (1) - 49 freq blin (1) - 116 freq ilie (1) - 1 freq iin (1) - 2 freq rilin (1) - 2 freq wilin (1) - 1 freq ili (1) - 1 freq bilin (1) - 42 freq ijin (1) - 1 freq pilin (1) - 9 freq ilia (1) - 1 freq icin (1) - 10 freq iyin (1) - 1 freq ailin (1) - 2 freq lin (1) - 10 freq milin (1) - 2 freq filin (1) - 3 freq bin (2) - 971 freq dirlin (2) - 45 freq ici (2) - 2 freq lid (2) - 71 freq hirlin (2) - 1 freq iim (2) - 2 freq chin (2) - 151 freq |
ilin (0) - 1 freq lin (1) - 10 freq ailin (1) - 2 freq lyn (2) - 17 freq lyin (2) - 332 freq oilan (2) - 1 freq alan (2) - 150 freq ulan (2) - 1 freq lon (2) - 2 freq alyn (2) - 1 freq elon (2) - 1 freq lion (2) - 147 freq lun (2) - 1 freq lain (2) - 18 freq lino (2) - 6 freq lan (2) - 139 freq alen (2) - 1 freq len (2) - 74 freq line (2) - 497 freq ln (2) - 7 freq lina (2) - 1 freq alon (2) - 2 freq alien (2) - 41 freq liein (2) - 3 freq alian (2) - 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 |
ILIN |
Time to execute Levenshtein function - 0.320370 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.724560 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.086226 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.087123 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.004654 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. |