| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whingytoddlers (0) - 1 freq toddlers (6) - 3 freq toddlurs (7) - 1 freq whistles (7) - 6 freq highlanders (7) - 17 freq handlers (7) - 1 freq high-rollers (7) - 1 freq mingsters (7) - 1 freq wingers (7) - 1 freq fiddlers (7) - 9 freq wrangdaers (7) - 5 freq ingethers (7) - 1 freq kindlers (7) - 1 freq toddlers' (7) - 2 freq whitdale (7) - 2 freq hinders (7) - 2 freq widders (7) - 2 freq whidder (7) - 24 freq thingyies (7) - 1 freq ringtones (7) - 1 freq hingers (7) - 5 freq shidders (7) - 2 freq toddles (7) - 1 freq whiddert (7) - 1 freq shinders (7) - 1 freq |
whingytoddlers (0) - 1 freq toddlers (10) - 3 freq chandlers (11) - 1 freq wrangdaers (11) - 5 freq handlers (11) - 1 freq toddlurs (11) - 1 freq toddler (12) - 2 freq shinders (12) - 1 freq whiddert (12) - 1 freq toddles (12) - 1 freq shidders (12) - 2 freq high-heelers (12) - 1 freq winters (12) - 21 freq chandeliers (12) - 1 freq wheengers (12) - 1 freq hangovers (12) - 4 freq hingers (12) - 5 freq whinges (12) - 1 freq winders (12) - 3 freq ringleaders (12) - 2 freq kindlers (12) - 1 freq ingethers (12) - 1 freq wingers (12) - 1 freq whistles (12) - 6 freq toddlers' (12) - 2 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNJTTLRS whingytoddlers - 1 freq |
WHINGYTODDLERS |
| Time to execute Levenshtein function - 0.225190 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.417063 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.029934 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.038895 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.000852 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. |