| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excludin (0) - 1 freq excludit (1) - 7 freq excluding (1) - 1 freq gncludin (2) - 1 freq explodin (2) - 6 freq excludes (2) - 1 freq occludin (2) - 1 freq exceedin (2) - 1 freq tncludin (2) - 1 freq excusin (2) - 1 freq excludit' (2) - 1 freq excluded (2) - 4 freq includin (2) - 133 freq excludet (2) - 1 freq exclusion (2) - 3 freq exclude (2) - 4 freq eveluin (3) - 1 freq concludin (3) - 3 freq enclosin (3) - 1 freq extendin (3) - 1 freq occludit (3) - 1 freq including (3) - 22 freq exceptin (3) - 6 freq includan (3) - 2 freq includin' (3) - 11 freq |
excludin (0) - 1 freq excludit (2) - 7 freq excluding (2) - 1 freq excluded (3) - 4 freq includin (3) - 133 freq exclude (3) - 4 freq excludet (3) - 1 freq occludin (3) - 1 freq excludes (3) - 1 freq explodin (3) - 6 freq exclusion (3) - 3 freq exceedin (3) - 1 freq includan (4) - 2 freq exclaimin (4) - 1 freq explodan (4) - 1 freq excludit' (4) - 1 freq tncludin (4) - 1 freq gncludin (4) - 1 freq excusin (4) - 1 freq deludin (5) - 1 freq eldin (5) - 3 freq cloodin (5) - 3 freq exclusive (5) - 10 freq includit (5) - 57 freq explorin (5) - 19 freq |
SoundEx code - E243 eagle-eyed - 2 freq eaglet - 14 freq ecouldnae - 1 freq equality - 34 freq escalator - 4 freq excelled - 1 freq exultation - 1 freq exhaled - 7 freq escalate - 3 freq escalates - 1 freq exalts - 1 freq excluded - 4 freq exclude - 4 freq ecaalt - 1 freq egalitarianism - 3 freq equality' - 1 freq excludet - 1 freq exiled - 6 freq ecouldna - 1 freq excludit - 7 freq equalitie - 4 freq equaility's - 1 freq excludit' - 1 freq ecalled - 1 freq easy-led - 1 freq eiggilt - 1 freq escalatit - 1 freq excludes - 1 freq egalitar-ian - 1 freq exultant - 1 freq exalted - 1 freq exaltit - 1 freq eagled - 1 freq excluding - 1 freq excludin - 1 freq eslidcmc - 1 freq |
MetaPhone code - EKSKLTN excludin - 1 freq |
EXCLUDIN |
| Time to execute Levenshtein function - 0.334054 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.389121 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.027753 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.039201 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.000934 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. |