| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wenceslas (0) - 1 freq wenceslas' (1) - 1 freq weesles (3) - 1 freq weeflas (3) - 3 freq wednesdays (4) - 2 freq cancels (4) - 2 freq necessar (4) - 88 freq engels (4) - 1 freq wednesday (4) - 170 freq iceslabs (4) - 1 freq pensells (4) - 3 freq weedas (4) - 1 freq enceladus (4) - 1 freq wedesday (4) - 1 freq wersels (4) - 1 freq winkels (4) - 1 freq excesses (4) - 2 freq enemas (4) - 1 freq weefla (4) - 47 freq winces (4) - 2 freq enless (4) - 12 freq weesks (4) - 1 freq weechils (4) - 1 freq kennels (4) - 5 freq fences (4) - 22 freq |
wenceslas (0) - 1 freq wenceslas' (2) - 1 freq weesles (5) - 1 freq winkels (6) - 1 freq wersels (6) - 1 freq pencils (6) - 9 freq sneesls (6) - 1 freq winces (6) - 2 freq wanless (6) - 3 freq weechils (6) - 1 freq conceals (6) - 1 freq wanlas (6) - 1 freq incels (6) - 1 freq winless (6) - 1 freq weeflas (6) - 3 freq wenches (6) - 2 freq cancels (6) - 2 freq windeas (7) - 1 freq vennels (7) - 12 freq wunnerlan (7) - 4 freq wendola (7) - 1 freq weelass (7) - 2 freq penels (7) - 7 freq fanckles (7) - 1 freq tencel (7) - 1 freq |
SoundEx code - W522 wenches - 2 freq wonka's - 24 freq 'wonka's - 2 freq wonkas - 2 freq wenceslas - 1 freq wenceslas' - 1 freq whinges - 1 freq wingies - 1 freq wheenges - 1 freq whimsical - 2 freq winchester - 1 freq winces - 2 freq wannecessar - 1 freq wankish - 1 freq winchesterderek - 1 freq whimsicallush - 1 freq |
MetaPhone code - WNSSLS wenceslas - 1 freq wenceslas' - 1 freq |
WENCESLAS |
| Time to execute Levenshtein function - 0.193978 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.352080 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.027448 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.037929 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.000829 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. |