Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wank (0) - 7 freq want (1) - 1616 freq hank (1) - 7 freq wang (1) - 6 freq yank (1) - 8 freq lank (1) - 3 freq wan' (1) - 2 freq tank (1) - 25 freq wauk (1) - 40 freq wanc (1) - 1 freq wan- (1) - 2 freq bank (1) - 186 freq watk (1) - 2 freq wakk (1) - 3 freq wan (1) - 2334 freq wane (1) - 12 freq wand (1) - 14 freq wanks (1) - 1 freq dank (1) - 11 freq waek (1) - 7 freq waik (1) - 28 freq mank (1) - 1 freq walk (1) - 464 freq swank (1) - 9 freq wans (1) - 167 freq |
wank (0) - 7 freq wink (1) - 117 freq swank (2) - 9 freq wans (2) - 167 freq walk (2) - 464 freq mank (2) - 1 freq waek (2) - 7 freq waik (2) - 28 freq wark (2) - 892 freq waak (2) - 53 freq wonka (2) - 297 freq winky (2) - 7 freq wonky (2) - 1 freq rank (2) - 42 freq sank (2) - 34 freq dank (2) - 11 freq wak (2) - 53 freq ank (2) - 1 freq fank (2) - 25 freq lank (2) - 3 freq tank (2) - 25 freq wauk (2) - 40 freq want (2) - 1616 freq wanks (2) - 1 freq hank (2) - 7 freq |
SoundEx code - W520 winnocks - 4 freq weans - 615 freq whuns - 5 freq wans - 167 freq winnock - 23 freq whimsy - 3 freq wance - 320 freq wink - 117 freq wings - 130 freq wean's - 31 freq wancee - 1 freq weengs - 9 freq wheems - 1 freq wing - 37 freq wins - 78 freq win's - 9 freq wang - 6 freq whines - 1 freq winks - 11 freq wans' - 1 freq waen's - 1 freq whangs - 5 freq wine's - 2 freq winkie - 3 freq wean''s - 1 freq wank - 7 freq whins - 12 freq wincey - 1 freq wheens - 2 freq wheenge - 7 freq wines - 8 freq whims - 5 freq winch - 6 freq whence - 5 freq weems - 1 freq wemyss - 3 freq when's - 6 freq wanes - 2 freq wains - 13 freq wench - 1 freq weang - 1 freq wonky - 1 freq wonka - 297 freq 'weans - 1 freq weans' - 9 freq wunnocks - 1 freq wunnock - 2 freq wuns - 3 freq winnie's - 1 freq 'winky - 1 freq winky - 7 freq winky-' - 1 freq winky- - 1 freq whinge - 2 freq wanks - 1 freq wan's - 13 freq weeyinish - 2 freq weeyins - 22 freq wungs - 1 freq wansce - 1 freq wanis - 3 freq weans's - 2 freq wunce - 1 freq wïngs - 1 freq whan's - 3 freq wames - 6 freq wino's - 1 freq wayne's - 1 freq weyans - 1 freq wymes - 1 freq whang - 6 freq 'wance - 1 freq whenk - 4 freq wheen's - 3 freq whaanious - 2 freq winsy - 1 freq wincy - 2 freq wheenks - 1 freq wanice - 1 freq wince - 4 freq wings' - 1 freq winniks - 2 freq weeng - 3 freq woons - 1 freq winnock's - 1 freq winos - 2 freq winnok - 9 freq whangie - 1 freq wee-ness - 1 freq wanease - 1 freq wenes - 1 freq weings - 1 freq wee-mawks - 1 freq winnoks - 2 freq winze - 1 freq wones - 1 freq waymes - 1 freq wuins - 1 freq weyms - 2 freq wÃngs - 1 freq wanc - 1 freq €œwance - 2 freq wonwc - 1 freq whaunÂ’s - 1 freq wmc - 1 freq wooing - 1 freq ‘weansÂ’ - 1 freq wayneg - 2 freq “weans” - 2 freq wansie - 1 freq wanÂ’s - 1 freq weymss - 1 freq weansÂ’ - 1 freq whens - 2 freq |
MetaPhone code - WNK winnock - 23 freq wink - 117 freq wing - 37 freq wang - 6 freq winkie - 3 freq wank - 7 freq weang - 1 freq wonky - 1 freq wonka - 297 freq wunnock - 2 freq 'winky - 1 freq winky - 7 freq winky-' - 1 freq winky- - 1 freq whang - 6 freq whenk - 4 freq weeng - 3 freq winnok - 9 freq wanc - 1 freq wonwc - 1 freq wooing - 1 freq wayneg - 2 freq |
WANK |
Time to execute Levenshtein function - 0.334985 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.562879 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.031170 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.069468 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.000850 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. |