| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnur (0) - 1 freq wunner (1) - 281 freq wunder (2) - 26 freq funner (2) - 1 freq wunnèr (2) - 1 freq funnul (2) - 1 freq wunne (2) - 1 freq gunnar (2) - 6 freq hunnurs (2) - 2 freq wunny (2) - 1 freq wunup (2) - 1 freq wunnert (2) - 28 freq wun'ner (2) - 1 freq wunn (2) - 9 freq hunnul (2) - 4 freq wunna (2) - 10 freq unner (2) - 454 freq wunsum (2) - 1 freq wunners (2) - 21 freq wonner (2) - 5 freq wunnd (2) - 1 freq winner (2) - 138 freq dunner (2) - 6 freq gunnul (2) - 2 freq hunner (2) - 434 freq |
wunnur (0) - 1 freq wunner (1) - 281 freq winner (2) - 138 freq wonner (2) - 5 freq wanner (2) - 17 freq hunner (3) - 434 freq cunnar (3) - 1 freq dunner (3) - 6 freq whanur (3) - 1 freq wunnd (3) - 1 freq winnurs (3) - 1 freq gunner (3) - 2 freq runner (3) - 19 freq wunnin (3) - 10 freq wunnae (3) - 13 freq wunnerd (3) - 1 freq wunter (3) - 27 freq wunnet (3) - 1 freq dinnur (3) - 1 freq funner (3) - 1 freq wunnert (3) - 28 freq wunners (3) - 21 freq wunny (3) - 1 freq wunder (3) - 26 freq wunne (3) - 1 freq |
SoundEx code - W560 wann'er - 1 freq winner - 138 freq wunner - 281 freq wummer - 1 freq wanweiry - 1 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wanner - 17 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 - 138 freq wunner - 281 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wanner - 17 freq wunnèr - 1 freq won'er - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq |
WUNNUR |
| Time to execute Levenshtein function - 0.230830 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.354513 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.027534 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.037297 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.000821 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. |