| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winnerfu (0) - 15 freq wunnerfu (1) - 56 freq wonnerfu (1) - 3 freq wunnerful (2) - 7 freq winderful (2) - 2 freq wonnerfu' (2) - 1 freq wunderfu (2) - 1 freq waunnerfu (2) - 1 freq winners (2) - 30 freq winnerd (2) - 1 freq winneret (2) - 1 freq wunnderfu (2) - 1 freq winners' (2) - 1 freq winnered (2) - 7 freq winner (2) - 138 freq winnerin (2) - 23 freq wunnerfa (2) - 1 freq winnert (2) - 40 freq wunnertu (2) - 2 freq wonderfu (2) - 4 freq wanner (3) - 17 freq linner (3) - 2 freq dinner's (3) - 1 freq wingers (3) - 1 freq winderfil (3) - 9 freq |
winnerfu (0) - 15 freq wonnerfu (1) - 3 freq wunnerfu (1) - 56 freq waunnerfu (2) - 1 freq wunnerfa (2) - 1 freq winnert (3) - 40 freq winnerin (3) - 23 freq winner (3) - 138 freq wunnertu (3) - 2 freq wonnerfu' (3) - 1 freq wunnerfae (3) - 4 freq wunnerful (3) - 7 freq winnered (3) - 7 freq wonderfu (3) - 4 freq winnerd (3) - 1 freq wunderfu (3) - 1 freq winneret (3) - 1 freq winners (3) - 30 freq wunnderfu (3) - 1 freq wunnerous (4) - 1 freq wunnerit (4) - 2 freq wunner (4) - 281 freq wunnered (4) - 43 freq wunnert (4) - 28 freq wannered (4) - 3 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 |
WINNERFU |
| Time to execute Levenshtein function - 0.188262 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.428793 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.028691 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.072668 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.000854 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. |