| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheengin (0) - 3 freq cheengin (1) - 13 freq weengan (2) - 1 freq wheedlin (2) - 2 freq sweengin (2) - 2 freq cheengit (2) - 3 freq sheenin (2) - 26 freq wheezin (2) - 8 freq wheeshin (2) - 2 freq wheekin (2) - 3 freq breengin (2) - 35 freq reengin (2) - 34 freq hengin (2) - 3 freq wheepin (2) - 3 freq wheezlin (2) - 1 freq wheenges (2) - 1 freq wheenge (2) - 7 freq wheetlin (2) - 1 freq cheyngin (2) - 3 freq whingin (2) - 4 freq cheingin (2) - 3 freq wheechin (2) - 40 freq wheeplin (2) - 8 freq wheenged (2) - 1 freq chengin (2) - 2 freq |
wheengin (0) - 3 freq whingin (2) - 4 freq cheengin (2) - 13 freq wheenges (3) - 1 freq cheyngin (3) - 3 freq wheenge (3) - 7 freq cheingin (3) - 3 freq chengin (3) - 2 freq wheenged (3) - 1 freq hengin (3) - 3 freq whingein (3) - 5 freq weengan (3) - 1 freq whinging (4) - 1 freq chaengan (4) - 1 freq whinkin (4) - 1 freq wrangin (4) - 1 freq whinin (4) - 8 freq whingit (4) - 1 freq hingin (4) - 377 freq chaingin (4) - 9 freq hangin (4) - 29 freq whangie (4) - 1 freq chyngin (4) - 49 freq chingin (4) - 3 freq changin (4) - 42 freq |
SoundEx code - W525 whingin - 4 freq winkin - 16 freq winsome - 5 freq winchin - 16 freq wenchin - 1 freq wanchancy - 18 freq wankin - 4 freq wheengin - 3 freq wanchauncie - 2 freq wincin - 1 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 - WNJN whingin - 4 freq wheengin - 3 freq whingein - 5 freq |
WHEENGIN |
| Time to execute Levenshtein function - 0.254144 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.391937 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.028975 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.039557 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.000973 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. |