Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
weengan (0) - 1 freq sweengan (1) - 2 freq peengan (1) - 1 freq weeng (2) - 3 freq een-an (2) - 1 freq reengin (2) - 34 freq weeman (2) - 9 freq keegan (2) - 2 freq sweengin (2) - 2 freq weengs (2) - 9 freq weenged (2) - 1 freq eenan (2) - 1 freq wheengin (2) - 3 freq weerg (3) - 1 freq wigan (3) - 1 freq seethan (3) - 1 freq weang (3) - 1 freq openan (3) - 4 freq ongan (3) - 2 freq waantan (3) - 14 freq hingan (3) - 18 freq clangan (3) - 1 freq weensland (3) - 1 freq feelan (3) - 18 freq teeman (3) - 2 freq |
weengan (0) - 1 freq peengan (2) - 1 freq sweengan (2) - 2 freq weenged (3) - 1 freq wheengin (3) - 3 freq sweengin (3) - 2 freq weengs (3) - 9 freq weeng (3) - 3 freq reengin (3) - 34 freq reingin (4) - 1 freq ringan (4) - 3 freq wogan (4) - 1 freq gangan (4) - 2 freq vengin (4) - 1 freq peingin (4) - 2 freq wenna (4) - 1 freq wrangin (4) - 1 freq ingan (4) - 11 freq swingan (4) - 1 freq winnan (4) - 1 freq avengin (4) - 1 freq wringin (4) - 13 freq wedgin (4) - 1 freq wengle (4) - 1 freq weings (4) - 1 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 - WNKN winkin - 16 freq wankin - 4 freq weengan - 1 freq whinkin - 1 freq |
WEENGAN |
Time to execute Levenshtein function - 0.223028 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.368282 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.029208 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.039134 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.000929 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. |