| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnerd (0) - 1 freq hunnerd (1) - 2 freq wunner (1) - 282 freq wunnert (1) - 30 freq winnerd (1) - 1 freq wunners (1) - 21 freq wunnered (1) - 44 freq wunnd (2) - 1 freq waunnert (2) - 6 freq unnerx (2) - 1 freq wundered (2) - 1 freq wunders (2) - 1 freq wun'ner (2) - 1 freq cunned (2) - 1 freq gunned (2) - 1 freq wunnerfa (2) - 1 freq wunted (2) - 3 freq wonner (2) - 5 freq waunners (2) - 2 freq runner (2) - 19 freq wanner (2) - 18 freq hunnerds (2) - 1 freq scunnerd (2) - 5 freq wanners (2) - 3 freq wunnur (2) - 1 freq |
wunnerd (0) - 1 freq winnerd (1) - 1 freq wunnered (1) - 44 freq wannered (2) - 3 freq winnered (2) - 7 freq wunnert (2) - 30 freq hunnerd (2) - 2 freq wunner (2) - 282 freq wunners (2) - 21 freq wonnert (3) - 11 freq winderd (3) - 1 freq wunnur (3) - 1 freq dunnered (3) - 1 freq wanners (3) - 3 freq winnert (3) - 40 freq winner (3) - 143 freq wunnerin (3) - 83 freq wunnerit (3) - 2 freq wonned (3) - 1 freq 'wunnered (3) - 1 freq winners (3) - 30 freq wannert (3) - 22 freq wundered (3) - 1 freq wunnertu (3) - 2 freq wonners (3) - 1 freq |
SoundEx code - W563 wunnered - 44 freq wunnert - 30 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 - 44 freq wunnert - 30 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 |
WUNNERD |
| Time to execute Levenshtein function - 0.327526 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.739856 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.030161 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.090387 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.000988 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. |