| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winkin (0) - 16 freq winrin (1) - 2 freq linkin (1) - 15 freq swinkin (1) - 1 freq sinkin (1) - 25 freq windin (1) - 28 freq wankin (1) - 4 freq whinkin (1) - 1 freq winnin (1) - 88 freq hinkin (1) - 83 freq pinkin (1) - 1 freq inkin (1) - 1 freq kinkin (1) - 3 freq winkie (1) - 3 freq binkin (1) - 1 freq rinkin (1) - 1 freq tinkin (1) - 57 freq jinkin (1) - 17 freq twinkin (1) - 1 freq finkin (1) - 8 freq winkit (1) - 11 freq wirkin (1) - 159 freq wintin (1) - 52 freq wilkin (1) - 2 freq wink (2) - 117 freq |
winkin (0) - 16 freq wankin (1) - 4 freq jinkin (2) - 17 freq tinkin (2) - 57 freq rinkin (2) - 1 freq binkin (2) - 1 freq finkin (2) - 8 freq winkit (2) - 11 freq wilkin (2) - 2 freq wintin (2) - 52 freq wirkin (2) - 159 freq winkie (2) - 3 freq twinkin (2) - 1 freq windin (2) - 28 freq swinkin (2) - 1 freq linkin (2) - 15 freq kinkin (2) - 3 freq whinkin (2) - 1 freq sinkin (2) - 25 freq pinkin (2) - 1 freq winrin (2) - 2 freq hinkin (2) - 83 freq inkin (2) - 1 freq winnin (2) - 88 freq tunkin (3) - 1 freq |
SoundEx code - W525 whingin - 4 freq winkin - 16 freq winsome - 5 freq winchin - 15 freq wenchin - 1 freq wanchancy - 18 freq wankin - 4 freq wheengin - 3 freq wanchauncie - 2 freq whingein - 5 freq wink-wink - 1 freq wineskins - 3 freq wunsum - 1 freq wineskïns - 1 freq wine-skins - 1 freq weengan - 1 freq wameskin - 1 freq wanchance - 1 freq wanchancie - 4 freq winchin' - 1 freq whinkin - 1 freq winsnae - 1 freq wanchany - 1 freq winging - 1 freq whinging - 1 freq winqm - 1 freq winchman - 1 freq wnzum - 1 freq wnusmqrptt - 1 freq wnquanjar - 1 freq |
MetaPhone code - WNKN winkin - 16 freq wankin - 4 freq weengan - 1 freq whinkin - 1 freq |
WINKIN |
| Time to execute Levenshtein function - 0.282522 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.504166 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.028085 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.078794 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.000828 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. |