| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waementin (0) - 1 freq cementin (2) - 1 freq waements (2) - 1 freq lamentin (2) - 7 freq waement (2) - 1 freq weetin (3) - 2 freq dementia (3) - 9 freq 'dementit (3) - 1 freq wauntin (3) - 2 freq absentin (3) - 1 freq cementing (3) - 1 freq fermentin (3) - 1 freq preventin (3) - 4 freq raemartin (3) - 1 freq repentin (3) - 1 freq wheengin (3) - 3 freq wantin (3) - 326 freq clementine (3) - 1 freq waantin (3) - 38 freq wakkenin (3) - 2 freq waakenin (3) - 2 freq augmentin (3) - 1 freq waments (3) - 1 freq dementit (3) - 22 freq parentin (3) - 1 freq |
waementin (0) - 1 freq waement (3) - 1 freq lamentin (3) - 7 freq cementin (3) - 1 freq waements (3) - 1 freq wantin (4) - 326 freq augmentin (4) - 1 freq wauntin (4) - 2 freq wahntin (4) - 1 freq wament (4) - 1 freq waments (4) - 1 freq waantin (4) - 38 freq muntin (5) - 11 freq wameskin (5) - 1 freq waukenin (5) - 7 freq wanton (5) - 2 freq waekent (5) - 1 freq mentain (5) - 1 freq mintin (5) - 20 freq waantan (5) - 14 freq wanten (5) - 1 freq emanatin (5) - 3 freq mantin (5) - 1 freq wintin (5) - 52 freq amountin (5) - 1 freq |
SoundEx code - W553 wumant' - 1 freq wammanhood - 1 freq womanhood - 1 freq waement - 1 freq waementin - 1 freq waements - 1 freq waments - 1 freq wament - 1 freq wumman-hater - 1 freq womanthatvotes - 1 freq |
MetaPhone code - WMNTN waementin - 1 freq |
WAEMENTIN |
| Time to execute Levenshtein function - 0.259991 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.433504 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.028661 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.071819 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.000913 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. |