| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnerfu (0) - 56 freq wunnerfa (1) - 1 freq wunnderfu (1) - 1 freq wunnerful (1) - 7 freq wonnerfu (1) - 3 freq winnerfu (1) - 15 freq wunderfu (1) - 1 freq wunnertu (1) - 2 freq waunnerfu (1) - 1 freq wunners (2) - 21 freq wunnered (2) - 43 freq wunnerfuul (2) - 1 freq wunnerful' (2) - 1 freq wunderful (2) - 2 freq wonderfu (2) - 4 freq wunnerd (2) - 1 freq wunnert (2) - 28 freq wunnerin (2) - 82 freq wunnèrfu (2) - 3 freq wunner (2) - 281 freq wonnerfu' (2) - 1 freq wunnerit (2) - 2 freq wunnerfae (2) - 4 freq wunnerous (2) - 1 freq scunnerfu (2) - 1 freq |
wunnerfu (0) - 56 freq wonnerfu (1) - 3 freq waunnerfu (1) - 1 freq wunnerfa (1) - 1 freq winnerfu (1) - 15 freq wunnerfae (2) - 4 freq wunnertu (2) - 2 freq wunnerful (2) - 7 freq wunnderfu (2) - 1 freq wunderfu (2) - 1 freq wunner (3) - 281 freq wunnerin (3) - 82 freq wonnerfu' (3) - 1 freq wunnerit (3) - 2 freq wunnerous (3) - 1 freq wunnert (3) - 28 freq wonderfu (3) - 4 freq wunnered (3) - 43 freq wunners (3) - 21 freq wunnerd (3) - 1 freq wunnerfuul (3) - 1 freq winner (4) - 138 freq waunnert (4) - 6 freq wunnur (4) - 1 freq wanner (4) - 17 freq |
SoundEx code - W561 wunnerful - 7 freq wunnerfae - 4 freq wunnerfu - 56 freq winnerfu - 15 freq wunnerfuul - 1 freq wunnèrfu - 3 freq wunnerful' - 1 freq waunnerfu - 1 freq wonnerfu' - 1 freq wanryfe - 1 freq winryfe - 1 freq wonnerfu - 3 freq wunnerfa - 1 freq |
MetaPhone code - WNRF wunnerfae - 4 freq wunnerfu - 56 freq winnerfu - 15 freq wunnèrfu - 3 freq waunnerfu - 1 freq wonnerfu' - 1 freq wanryfe - 1 freq winryfe - 1 freq wonnerfu - 3 freq wunnerfa - 1 freq |
WUNNERFU |
| Time to execute Levenshtein function - 0.282806 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.431014 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.027175 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.062788 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.000780 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. |