Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
winged (0) - 5 freq dinged (1) - 18 freq binged (1) - 1 freq winted (1) - 41 freq winced (1) - 2 freq winger (1) - 3 freq jinged (1) - 1 freq widged (1) - 1 freq winded (1) - 2 freq pinged (1) - 1 freq winked (1) - 12 freq ringed (1) - 7 freq tinged (1) - 4 freq minged (1) - 1 freq singed (1) - 3 freq wined (1) - 4 freq wirmed (2) - 2 freq linger (2) - 5 freq singled (2) - 1 freq wings (2) - 131 freq wirked (2) - 35 freq twinned (2) - 3 freq weenged (2) - 1 freq dwined (2) - 18 freq sinsed (2) - 1 freq |
winged (0) - 5 freq ringed (2) - 7 freq winked (2) - 12 freq tinged (2) - 4 freq singed (2) - 3 freq weenged (2) - 1 freq pinged (2) - 1 freq minged (2) - 1 freq wined (2) - 4 freq winted (2) - 41 freq winded (2) - 2 freq dinged (2) - 18 freq winced (2) - 2 freq binged (2) - 1 freq winger (2) - 3 freq jinged (2) - 1 freq widged (2) - 1 freq wranged (3) - 2 freq hanged (3) - 6 freq monged (3) - 1 freq longed (3) - 5 freq wingies (3) - 1 freq windee (3) - 3 freq wunted (3) - 3 freq wangled (3) - 1 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNJT whanged - 1 freq wheenged - 1 freq wingit - 4 freq winged - 5 freq whingit - 1 freq weenged - 1 freq |
WINGED |
Time to execute Levenshtein function - 0.182413 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.333023 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.027372 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.041163 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.000926 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. |