| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnér (0) - 2 freq wunnèr (1) - 1 freq unnér (1) - 5 freq wuntér (1) - 1 freq wunnérs (1) - 1 freq hunnér (1) - 3 freq hunnérs (2) - 2 freq plunnér (2) - 1 freq unnèr (2) - 27 freq wunner (2) - 282 freq dannér (2) - 1 freq wannért (2) - 1 freq wunnèrt (2) - 2 freq hunnèr (2) - 24 freq wunnérin (2) - 1 freq wunnur (2) - 1 freq cunnar (3) - 1 freq runner (3) - 19 freq wunnock (3) - 2 freq dunner (3) - 6 freq unnser (3) - 8 freq wunnther (3) - 1 freq wunny (3) - 1 freq unnder (3) - 1 freq hunnder (3) - 1 freq |
wunnér (0) - 2 freq hunnér (2) - 3 freq wunnérs (2) - 1 freq wuntér (2) - 1 freq wunnèr (2) - 1 freq unnér (2) - 5 freq wunnérin (3) - 1 freq dannér (3) - 1 freq wannért (3) - 1 freq wunnur (4) - 1 freq wunner (4) - 282 freq hunnérs (4) - 2 freq hunnèr (4) - 24 freq plunnér (4) - 1 freq unnèr (4) - 27 freq wunnèrt (4) - 2 freq dennèr (5) - 4 freq wanner (5) - 18 freq winner (5) - 143 freq hinnèr (5) - 1 freq wonner (5) - 5 freq wunnèrin (5) - 5 freq wattér (5) - 8 freq wunnèrfu (5) - 3 freq wunnther (5) - 1 freq |
SoundEx code - W560 wann'er - 1 freq winner - 143 freq wunner - 282 freq wummer - 1 freq wanweiry - 1 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wanner - 18 freq whinner - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wunnèr - 1 freq won'er - 1 freq wun'ner - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq win-ower - 1 freq weimar - 1 freq wnar - 1 freq |
MetaPhone code - WNR wann'er - 1 freq winner - 143 freq wunner - 282 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wanner - 18 freq whinner - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wunnèr - 1 freq won'er - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq |
WUNNÉR |
| Time to execute Levenshtein function - 0.181166 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.339345 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.028337 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.038644 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.000954 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. |