| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whingein (0) - 5 freq whingin (1) - 4 freq wringin (2) - 13 freq hingin (2) - 369 freq hingen (2) - 2 freq whinin (2) - 8 freq whinges (2) - 1 freq whingit (2) - 1 freq whinkin (2) - 1 freq chingin (2) - 3 freq whinneyin (2) - 1 freq whinging (2) - 1 freq whinge (2) - 2 freq wintin (3) - 52 freq winkin (3) - 16 freq wrangin (3) - 1 freq wheengin (3) - 3 freq thinkin (3) - 574 freq hangin (3) - 29 freq whitten (3) - 11 freq minglin (3) - 2 freq whanged (3) - 1 freq flingin (3) - 46 freq whidderin (3) - 5 freq hinges (3) - 19 freq |
whingein (0) - 5 freq whingin (1) - 4 freq whinneyin (3) - 1 freq chingin (3) - 3 freq whinge (3) - 2 freq wheengin (3) - 3 freq whinkin (3) - 1 freq whinging (3) - 1 freq whingit (3) - 1 freq wringin (3) - 13 freq hingen (3) - 2 freq hingin (3) - 369 freq whinin (3) - 8 freq whinges (3) - 1 freq chengin (4) - 2 freq hengin (4) - 3 freq changin (4) - 40 freq whangie (4) - 1 freq hingan (4) - 18 freq whinney (4) - 1 freq cheingin (4) - 3 freq onhingin (4) - 1 freq chaingin (4) - 9 freq chyngin (4) - 49 freq wrangin (4) - 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 - WNJN whingin - 4 freq wheengin - 3 freq whingein - 5 freq |
WHINGEIN |
| Time to execute Levenshtein function - 0.217463 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.365440 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.029344 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.037261 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.000814 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. |