| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winnerd (0) - 1 freq winderd (1) - 1 freq wunnerd (1) - 1 freq winnert (1) - 40 freq winners (1) - 30 freq winnered (1) - 7 freq winner (1) - 138 freq binner (2) - 2 freq wintery (2) - 5 freq wanner (2) - 17 freq tinner (2) - 1 freq wonned (2) - 1 freq winked (2) - 12 freq linned (2) - 2 freq pinned (2) - 22 freq wined (2) - 3 freq rinners (2) - 7 freq winger (2) - 3 freq wiener (2) - 2 freq sinners (2) - 8 freq sinnert (2) - 1 freq winder (2) - 112 freq binned (2) - 1 freq wannered (2) - 3 freq inner (2) - 44 freq |
winnerd (0) - 1 freq wunnerd (1) - 1 freq winnered (1) - 7 freq winderd (2) - 1 freq wannered (2) - 3 freq winnert (2) - 40 freq winner (2) - 138 freq winners (2) - 30 freq wunnered (2) - 43 freq wintered (3) - 2 freq hinnered (3) - 1 freq windered (3) - 27 freq wunner (3) - 281 freq wunners (3) - 21 freq wonner (3) - 5 freq winnerfu (3) - 15 freq hunnerd (3) - 2 freq wannert (3) - 22 freq wonners (3) - 1 freq winnirt (3) - 1 freq wonnert (3) - 11 freq wunnert (3) - 28 freq winneret (3) - 1 freq wanners (3) - 3 freq winnurs (3) - 1 freq |
SoundEx code - W563 wunnered - 43 freq wunnert - 28 freq waunnert - 6 freq waunert - 6 freq wannert - 22 freq winnered - 7 freq winnert - 40 freq winnirt - 1 freq wannered - 3 freq 'wunnered - 1 freq wunnerit - 2 freq wunnerd - 1 freq wannért - 1 freq wunnèrt - 2 freq wunnertu - 2 freq wanwirt - 2 freq wonnert - 11 freq wanwirth - 2 freq winneret - 1 freq waanert - 1 freq wanneret - 1 freq winnerd - 1 freq whmrdf - 1 freq |
MetaPhone code - WNRT wunnered - 43 freq wunnert - 28 freq waunnert - 6 freq waunert - 6 freq wannert - 22 freq winnered - 7 freq winnert - 40 freq winnirt - 1 freq wannered - 3 freq 'wunnered - 1 freq wunnerit - 2 freq wunnerd - 1 freq wannért - 1 freq wunnèrt - 2 freq wunnertu - 2 freq wonnert - 11 freq winneret - 1 freq waanert - 1 freq wanneret - 1 freq winnerd - 1 freq |
WINNERD |
| Time to execute Levenshtein function - 0.212713 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.407394 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.031908 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.041125 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.000780 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. |