| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enlarged (0) - 1 freq enlarge (1) - 1 freq enlarged' (1) - 1 freq engaged (2) - 19 freq engorged (2) - 1 freq blarged (2) - 1 freq enraged (2) - 4 freq snagged (3) - 1 freq glared (3) - 2 freq slagged (3) - 5 freq engaged' (3) - 1 freq neared (3) - 3 freq charged (3) - 24 freq varged (3) - 1 freq unwaged (3) - 1 freq slanged (3) - 1 freq encased (3) - 2 freq knarled (3) - 1 freq enrages (3) - 2 freq alarmed (3) - 1 freq large (3) - 59 freq gnarred (3) - 1 freq blared (3) - 3 freq endured (3) - 5 freq endanger (3) - 1 freq |
enlarged (0) - 1 freq enlarged' (2) - 1 freq enlarge (2) - 1 freq blarged (3) - 1 freq enraged (3) - 4 freq engorged (3) - 1 freq unlearned (4) - 1 freq engaged (4) - 19 freq nagged (5) - 3 freq flagged (5) - 3 freq endorsed (5) - 3 freq belanged (5) - 49 freq larned (5) - 12 freq claried (5) - 1 freq larger (5) - 3 freq darged (5) - 1 freq splairged (5) - 5 freq enrage (5) - 3 freq unmarked (5) - 1 freq emerged (5) - 17 freq salaried (5) - 2 freq enforced (5) - 3 freq narked (5) - 1 freq encouraged (5) - 26 freq barged (5) - 2 freq |
SoundEx code - E546 enlarged' - 1 freq enlarge - 1 freq enlarged - 1 freq enlargement - 1 freq |
MetaPhone code - ENLRJT enlarged' - 1 freq enlarged - 1 freq |
ENLARGED |
| Time to execute Levenshtein function - 0.344215 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.777272 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.086468 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.040888 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.000888 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. |