| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wonnert (0) - 11 freq wonners (1) - 1 freq wonner (1) - 5 freq wunnert (1) - 28 freq winnert (1) - 40 freq wondert (1) - 10 freq wannert (1) - 22 freq donnert (1) - 20 freq funnert (2) - 2 freq binnert (2) - 1 freq winneret (2) - 1 freq wanners (2) - 3 freq wonned (2) - 1 freq bonnet (2) - 34 freq convert (2) - 12 freq sinnert (2) - 1 freq mannert (2) - 1 freq wanner (2) - 17 freq wunnerit (2) - 2 freq cornert (2) - 1 freq yonner (2) - 67 freq wunners (2) - 21 freq conner (2) - 2 freq winners (2) - 30 freq wunnertu (2) - 2 freq |
wonnert (0) - 11 freq wannert (1) - 22 freq wunnert (1) - 28 freq winnert (1) - 40 freq wunnerit (2) - 2 freq wunnertu (2) - 2 freq winnirt (2) - 1 freq wanneret (2) - 1 freq winneret (2) - 1 freq waunnert (2) - 6 freq donnert (2) - 20 freq wondert (2) - 10 freq wonner (2) - 5 freq wonners (2) - 1 freq founnert (3) - 1 freq wunnet (3) - 1 freq waanert (3) - 1 freq binnert (3) - 1 freq dannert (3) - 3 freq wonnerfu (3) - 3 freq winnerd (3) - 1 freq wundert (3) - 1 freq waunert (3) - 6 freq wnvert (3) - 1 freq hinnert (3) - 3 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 |
WONNERT |
| Time to execute Levenshtein function - 0.178215 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.347332 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.028260 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.037093 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.000856 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. |