| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winding (0) - 2 freq windin (1) - 28 freq winging (1) - 1 freq minding (1) - 7 freq finding (1) - 16 freq binding (1) - 1 freq winning (1) - 13 freq tending (2) - 3 freq welding (2) - 2 freq landing (2) - 11 freq ringing (2) - 4 freq inning (2) - 1 freq mindins (2) - 15 freq wiring (2) - 2 freq widdin (2) - 4 freq wirdin (2) - 2 freq finking (2) - 1 freq minging (2) - 5 freq mindings (2) - 1 freq funding (2) - 5 freq windi (2) - 2 freq hinking (2) - 7 freq tinking (2) - 1 freq findins (2) - 4 freq findin' (2) - 3 freq |
winding (0) - 2 freq binding (2) - 1 freq windin (2) - 28 freq finding (2) - 16 freq winning (2) - 13 freq minding (2) - 7 freq winging (2) - 1 freq wunting (3) - 1 freq wanting (3) - 18 freq weeding (3) - 1 freq windbag (3) - 2 freq punding (3) - 1 freq waning (3) - 1 freq onding (3) - 9 freq ending (3) - 17 freq wording (3) - 7 freq bonding (3) - 1 freq handing (3) - 2 freq wedding (3) - 19 freq wading (3) - 1 freq pending (3) - 1 freq sending (3) - 13 freq landing (3) - 11 freq welding (3) - 2 freq tending (3) - 3 freq |
SoundEx code - W535 wantin - 321 freq wanting - 18 freq wind-moan - 1 freq wonuddnuae - 1 freq windin - 28 freq wintin - 52 freq waantin - 38 freq windmill - 2 freq woundin - 1 freq windin-sheets - 1 freq wantin' - 6 freq wanton - 2 freq winding - 2 freq wondenn - 1 freq wyntown - 1 freq wndwne - 1 freq wyntoun's - 1 freq wantan - 4 freq windmills - 2 freq waantan - 14 freq wan-time - 1 freq wyndin - 2 freq wuntin - 9 freq wuntin't - 1 freq wynton - 1 freq wyntoun - 1 freq wintoun - 5 freq wahntin - 1 freq wanten - 1 freq windin - 1 freq wunting - 1 freq wmtim - 1 freq wyndhamsusan - 1 freq wintonbrewery - 9 freq wauntin - 2 freq |
MetaPhone code - WNTNK wanting - 18 freq winding - 2 freq wunting - 1 freq |
WINDING |
| Time to execute Levenshtein function - 0.217851 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.400622 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.037648 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.047059 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.001040 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. |