| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wnkdqi (0) - 1 freq windi (3) - 2 freq wudni (3) - 4 freq qkdi (3) - 1 freq dqi (3) - 1 freq wkd (3) - 4 freq wbki (3) - 1 freq widni (3) - 3 freq wgdli (3) - 1 freq wkds (3) - 2 freq widyi (3) - 21 freq snkkwi (3) - 1 freq wiki (3) - 5 freq onwpqi (3) - 1 freq widdyi (3) - 1 freq wvcpq (4) - 1 freq £ni (4) - 2 freq nedeit (4) - 1 freq werds (4) - 1 freq waket (4) - 1 freq worded (4) - 1 freq wundie (4) - 1 freq wonder (4) - 140 freq wak'ed (4) - 3 freq neddir (4) - 3 freq |
wnkdqi (0) - 1 freq winked (5) - 12 freq wkd (5) - 4 freq wkds (5) - 2 freq windi (5) - 2 freq wind (6) - 482 freq wank (6) - 8 freq winkers (6) - 1 freq wonkas (6) - 2 freq windoo (6) - 1 freq winkled (6) - 1 freq winkels (6) - 1 freq winder (6) - 112 freq awned (6) - 27 freq wend (6) - 1 freq windle (6) - 1 freq wined (6) - 4 freq windae (6) - 564 freq windas (6) - 4 freq windie (6) - 4 freq wikkday (6) - 1 freq winda (6) - 47 freq windup (6) - 1 freq window (6) - 95 freq windy (6) - 36 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 - NKTK neukatyke - 1 freq wnkdqi - 1 freq |
WNKDQI |
| Time to execute Levenshtein function - 0.196541 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.351805 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.030883 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.037235 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.000900 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. |