| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| illegality (0) - 1 freq legality (2) - 2 freq illegally (2) - 2 freq illegal (3) - 31 freq illogicality (3) - 1 freq illegals (3) - 1 freq ill-gaits (3) - 1 freq collegiality (3) - 1 freq lealty (4) - 5 freq inequality (4) - 7 freq locality (4) - 3 freq ill-gattit (4) - 1 freq reality (4) - 115 freq integrity (4) - 13 freq relegatit (4) - 3 freq penality (4) - 1 freq leebrality (4) - 1 freq ill-gaited (4) - 1 freq plurality (4) - 3 freq legally (4) - 13 freq vulgarity (4) - 1 freq legacy (5) - 44 freq solidarity (5) - 23 freq quaality (5) - 5 freq bekalite (5) - 1 freq |
illegality (0) - 1 freq legality (3) - 2 freq illegally (3) - 2 freq collegiality (4) - 1 freq illegals (4) - 1 freq illogicality (4) - 1 freq illegal (4) - 31 freq plurality (6) - 3 freq legally (6) - 13 freq vulgarity (6) - 1 freq leebrality (6) - 1 freq relegatit (6) - 3 freq ill-gaits (6) - 1 freq locality (6) - 3 freq lealty (6) - 5 freq legal (7) - 85 freq gullibility (7) - 1 freq liminality (7) - 1 freq legalities (7) - 1 freq fleggit (7) - 60 freq elegant (7) - 12 freq ballygally (7) - 1 freq agility (7) - 1 freq jollity (7) - 2 freq delegate (7) - 3 freq |
SoundEx code - I424 illegal - 31 freq illegally - 2 freq ill-claed - 1 freq ilkley - 1 freq €œillegals - 1 freq illegals - 1 freq illegality - 1 freq |
MetaPhone code - ILKLT ill-claed - 1 freq illegality - 1 freq |
ILLEGALITY |
| Time to execute Levenshtein function - 0.219183 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.350736 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.027550 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.036848 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.000874 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. |