| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnert (0) - 28 freq wunners (1) - 21 freq wundert (1) - 1 freq wannert (1) - 22 freq wunnerd (1) - 1 freq dunnert (1) - 1 freq wunner (1) - 281 freq wunnertu (1) - 2 freq hunnert (1) - 14 freq winnert (1) - 40 freq wunnet (1) - 1 freq waunnert (1) - 6 freq wunnerit (1) - 2 freq wonnert (1) - 11 freq funnert (1) - 2 freq wondert (2) - 10 freq lundert (2) - 1 freq wnvert (2) - 1 freq winnerd (2) - 1 freq unnerx (2) - 1 freq thunnert (2) - 2 freq hinnert (2) - 3 freq bunnet (2) - 111 freq donnert (2) - 20 freq skunnert (2) - 1 freq |
wunnert (0) - 28 freq winnert (1) - 40 freq wunnerit (1) - 2 freq wonnert (1) - 11 freq wunnertu (1) - 2 freq waunnert (1) - 6 freq wannert (1) - 22 freq wunner (2) - 281 freq wunners (2) - 21 freq wanneret (2) - 1 freq winneret (2) - 1 freq winnirt (2) - 1 freq wundert (2) - 1 freq funnert (2) - 2 freq dunnert (2) - 1 freq hunnert (2) - 14 freq wunnerd (2) - 1 freq wunnet (2) - 1 freq waunners (3) - 2 freq wunnerin (3) - 82 freq waunert (3) - 6 freq wunnerfa (3) - 1 freq daunnert (3) - 5 freq binnert (3) - 1 freq sinnert (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 |
WUNNERT |
| Time to execute Levenshtein function - 0.188633 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.351681 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.027549 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.037105 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.000864 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. |