| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winkt (0) - 2 freq wink (1) - 118 freq winkit (1) - 11 freq wirkt (1) - 3 freq win't (1) - 4 freq wint (1) - 629 freq linkt (1) - 2 freq winky (1) - 7 freq winks (1) - 14 freq wince (2) - 5 freq wi't (2) - 59 freq win (2) - 980 freq wiout (2) - 16 freq rint (2) - 4 freq wirks (2) - 50 freq wi'it (2) - 2 freq wingit (2) - 4 freq jint (2) - 6 freq sinkn (2) - 1 freq sink (2) - 100 freq linkit (2) - 16 freq wanst (2) - 32 freq wiet (2) - 2 freq links (2) - 70 freq wing (2) - 38 freq |
winkt (0) - 2 freq winkit (1) - 11 freq winky (2) - 7 freq wink (2) - 118 freq linkt (2) - 2 freq winks (2) - 14 freq wirkt (2) - 3 freq win't (2) - 4 freq wint (2) - 629 freq wicket (3) - 2 freq wannt (3) - 1 freq jinkit (3) - 7 freq tinkte (3) - 1 freq wont (3) - 31 freq wickit (3) - 36 freq dinkit (3) - 1 freq gunkt (3) - 2 freq winked (3) - 12 freq wonka (3) - 297 freq walkt (3) - 28 freq tinkit (3) - 1 freq wintit (3) - 111 freq winkie (3) - 3 freq wanit (3) - 1 freq want (3) - 1648 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 - WNKT winked - 12 freq winkt - 2 freq winkit - 11 freq wanc't - 1 freq |
WINKT |
| Time to execute Levenshtein function - 0.269691 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.409136 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.037642 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.039736 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.000887 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. |