Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
illumination (0) - 2 freq illuminations (1) - 3 freq illuminatioun (1) - 1 freq illuminatin (1) - 4 freq illuminatit (2) - 2 freq illuminatan (2) - 1 freq illuminating (2) - 1 freq illuminated (3) - 3 freq illuminates (3) - 2 freq lamination (3) - 1 freq illustration (3) - 6 freq hallucination (3) - 3 freq culmination (3) - 3 freq illuminate (3) - 2 freq exemination (4) - 1 freq imaagination (4) - 1 freq limitation (4) - 1 freq hallucinatin (4) - 2 freq imaigination (4) - 7 freq examination (4) - 8 freq dissemination (4) - 1 freq inclination (4) - 6 freq abomination (4) - 5 freq nomination (4) - 1 freq imagination (4) - 60 freq |
illumination (0) - 2 freq illuminatin (1) - 4 freq illuminatioun (1) - 1 freq illuminatan (2) - 1 freq illuminations (2) - 3 freq illuminating (3) - 1 freq illuminatit (3) - 2 freq illuminate (4) - 2 freq culmination (4) - 3 freq lamination (4) - 1 freq illuminates (4) - 2 freq illuminated (4) - 3 freq hallucination (5) - 3 freq denomination (6) - 1 freq nomination (6) - 1 freq defemination (6) - 1 freq domination (6) - 1 freq commination (6) - 2 freq abomination (6) - 5 freq pollination (6) - 1 freq limitation (6) - 1 freq illustration (6) - 6 freq exemination (6) - 1 freq hallucinatin (6) - 2 freq examination (6) - 8 freq |
SoundEx code - I455 ill-mainnered - 2 freq illuminatioun - 1 freq illuminations - 3 freq illuminatin - 4 freq ill-mennered - 2 freq illuminatan - 1 freq illuminates - 2 freq illuminated - 3 freq illuminatit - 2 freq ill-mainered - 2 freq illumine - 1 freq illuminate - 2 freq illumination - 2 freq ill-omen - 1 freq illuminating - 1 freq ileenemac - 2 freq |
MetaPhone code - ILMNXN illuminatioun - 1 freq illumination - 2 freq |
ILLUMINATION |
Time to execute Levenshtein function - 0.456513 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.654118 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.067127 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.080166 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.000982 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. |