| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlamentin (0) - 1 freq unlamentit (1) - 1 freq lamentin (2) - 7 freq unrelentin (3) - 3 freq lamentit (3) - 1 freq unpatentit (3) - 1 freq unlairnin (3) - 1 freq clementine (4) - 1 freq ornamentit (4) - 1 freq unwaverin (4) - 1 freq implementin (4) - 3 freq parentin (4) - 1 freq unendin (4) - 2 freq parliamentin (4) - 1 freq augmentin (4) - 1 freq unplantit (4) - 1 freq plentin (4) - 1 freq implymentin (4) - 26 freq unlearnin (4) - 1 freq fundamental (4) - 24 freq undaein (4) - 2 freq slantin (4) - 2 freq fermentin (4) - 1 freq plantin (4) - 22 freq laments (4) - 9 freq |
unlamentin (0) - 1 freq unlamentit (2) - 1 freq lamentin (3) - 7 freq clementine (5) - 1 freq unlairnin (5) - 1 freq unrelentin (5) - 3 freq lamentit (5) - 1 freq tullimentan (6) - 4 freq waementin (6) - 1 freq glentin (6) - 34 freq unromantic (6) - 2 freq filament (6) - 2 freq lamented (6) - 2 freq unstintin (6) - 1 freq filaments (6) - 1 freq inleitin (6) - 2 freq galavantin (6) - 1 freq 'lament (6) - 3 freq cementin (6) - 1 freq unremittin (6) - 1 freq nominatin (6) - 1 freq commentin (6) - 4 freq inventin (6) - 22 freq lament (6) - 22 freq lamination (6) - 1 freq |
SoundEx code - U545 unweelness - 1 freq 'unweelness' - 1 freq unwillint - 1 freq unalane - 1 freq unwillingness - 2 freq unlimited - 21 freq unwillin - 7 freq unlandit - 1 freq unweillness - 1 freq unlamentit - 1 freq unwullant - 1 freq unlamentin - 1 freq unwilling - 1 freq |
MetaPhone code - UNLMNTN unlamentin - 1 freq |
UNLAMENTIN |
| Time to execute Levenshtein function - 0.226958 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.379102 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.027425 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.037296 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.000909 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. |