| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wannert (0) - 22 freq wunnert (1) - 28 freq wanneret (1) - 1 freq dannert (1) - 3 freq wandert (1) - 5 freq winnert (1) - 40 freq wanners (1) - 3 freq mannert (1) - 1 freq waanert (1) - 1 freq waunert (1) - 6 freq waunnert (1) - 6 freq wonnert (1) - 11 freq wanner (1) - 17 freq wanrest (2) - 1 freq cannery (2) - 1 freq wannerin (2) - 9 freq wonner (2) - 5 freq wannért (2) - 1 freq wanderit (2) - 2 freq wastert (2) - 1 freq winners (2) - 30 freq dunnert (2) - 1 freq wagners (2) - 1 freq binnert (2) - 1 freq banners (2) - 15 freq |
wannert (0) - 22 freq winnert (1) - 40 freq waunnert (1) - 6 freq wunnert (1) - 28 freq wanneret (1) - 1 freq wonnert (1) - 11 freq wanner (2) - 17 freq winnirt (2) - 1 freq winneret (2) - 1 freq wunnertu (2) - 2 freq wunnerit (2) - 2 freq dannert (2) - 3 freq wandert (2) - 5 freq wanners (2) - 3 freq waunert (2) - 6 freq waanert (2) - 1 freq mannert (2) - 1 freq wunnerd (3) - 1 freq wondert (3) - 10 freq hunnert (3) - 14 freq wnvert (3) - 1 freq funnert (3) - 2 freq winnerd (3) - 1 freq wunner (3) - 281 freq wannerer (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 |
WANNERT |
| Time to execute Levenshtein function - 0.232705 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.387154 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.028380 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.037918 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.000976 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. |