| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wonkas (0) - 2 freq wonka's (1) - 24 freq wonka (1) - 297 freq jonas (2) - 2 freq workan (2) - 9 freq donks (2) - 5 freq conk's (2) - 1 freq yonks (2) - 6 freq monk's (2) - 1 freq 'wonka's (2) - 2 freq wona (2) - 1 freq tonka (2) - 2 freq zonks (2) - 1 freq ronas (2) - 3 freq wundas (2) - 1 freq honks (2) - 1 freq windas (2) - 2 freq winks (2) - 11 freq wanks (2) - 1 freq wonky (2) - 1 freq gonks (2) - 1 freq onks (2) - 1 freq work's (2) - 3 freq works (2) - 118 freq wones (2) - 1 freq |
wonkas (0) - 2 freq wonka's (2) - 24 freq wanks (2) - 1 freq wonka (2) - 297 freq winks (2) - 11 freq honks (3) - 1 freq wonky (3) - 1 freq windas (3) - 2 freq onks (3) - 1 freq wanlas (3) - 1 freq monks (3) - 23 freq wones (3) - 1 freq wundas (3) - 1 freq gonks (3) - 1 freq works (3) - 118 freq yonks (3) - 6 freq donks (3) - 5 freq zonks (3) - 1 freq windis (4) - 2 freq wino's (4) - 1 freq noks (4) - 1 freq waiks (4) - 1 freq wank (4) - 7 freq winkers (4) - 1 freq wulks (4) - 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 - WNKS winnocks - 4 freq wings - 130 freq weengs - 9 freq winks - 11 freq whangs - 5 freq wunnocks - 1 freq wanks - 1 freq wungs - 1 freq wonka's - 24 freq 'wonka's - 2 freq wonkas - 2 freq wheenks - 1 freq wings' - 1 freq winniks - 2 freq winnock's - 1 freq weings - 1 freq winnoks - 2 freq |
WONKAS |
| Time to execute Levenshtein function - 0.224597 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.356282 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.034737 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.038605 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.000873 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. |