| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| win-ower (0) - 1 freq hing-ower (2) - 1 freq hingower (2) - 1 freq widower (2) - 2 freq inower (2) - 10 freq winner (3) - 138 freq inrowes (3) - 1 freq minoover (3) - 1 freq winter (3) - 427 freq i'lower (3) - 1 freq incomer (3) - 9 freq oot-ower (3) - 1 freq innoyer (3) - 1 freq windows (3) - 26 freq winsome (3) - 5 freq luk-ower (3) - 4 freq hangower (3) - 3 freq tak-ower (3) - 1 freq win-swept (3) - 1 freq weedower (3) - 2 freq windier (3) - 1 freq kaim-ower (3) - 1 freq set-ower (3) - 1 freq widowed (3) - 1 freq windoes (3) - 1 freq |
win-ower (0) - 1 freq wanceower (4) - 1 freq hing-ower (4) - 1 freq inower (4) - 10 freq hingower (4) - 1 freq widower (4) - 2 freq hungower (5) - 1 freq set-ower (5) - 1 freq winger (5) - 3 freq windier (5) - 1 freq kaim-ower (5) - 1 freq window (5) - 92 freq winnowin (5) - 3 freq wan-wye (5) - 1 freq weedower (5) - 2 freq out-ower (5) - 1 freq winkler (5) - 1 freq winder (5) - 112 freq infowar (5) - 1 freq oot-ower (5) - 1 freq winter (5) - 427 freq awnswer (5) - 2 freq winner (5) - 138 freq windows (5) - 26 freq luk-ower (5) - 4 freq |
SoundEx code - W560 wann'er - 1 freq winner - 138 freq wunner - 281 freq wummer - 1 freq wanweiry - 1 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wanner - 17 freq wunnèr - 1 freq won'er - 1 freq wun'ner - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq win-ower - 1 freq weimar - 1 freq wnar - 1 freq |
MetaPhone code - WNWR wanweiry - 1 freq win-ower - 1 freq |
WIN-OWER |
| Time to execute Levenshtein function - 0.205002 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.352460 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.027515 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.036848 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.000794 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. |