| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnerful (0) - 7 freq wunderful (1) - 2 freq wunnerful' (1) - 1 freq wunnerfuul (1) - 1 freq wunnerfu (1) - 56 freq winderful (2) - 2 freq wunnerfa (2) - 1 freq wunnerfae (2) - 4 freq wunnerous (2) - 1 freq wunnertu (2) - 2 freq wonnerfu (2) - 3 freq winnerfu (2) - 15 freq wonnerfu' (2) - 1 freq wunnderfu (2) - 1 freq wunderfu (2) - 1 freq wonderful (2) - 41 freq hunnerfaul (2) - 1 freq waunnerfu (2) - 1 freq scunnerfu (3) - 1 freq wonderfu' (3) - 1 freq wunner (3) - 281 freq 'wonderful (3) - 1 freq unnerfelt (3) - 1 freq wunnerlaun (3) - 4 freq wunnert (3) - 28 freq |
wunnerful (0) - 7 freq wunnerfuul (1) - 1 freq wunnerfu (2) - 56 freq wunnerful' (2) - 1 freq wunderful (2) - 2 freq wonnerfu' (3) - 1 freq winnerfu (3) - 15 freq waunnerfu (3) - 1 freq wonnerfu (3) - 3 freq hunnerfaul (3) - 1 freq wunnerfae (3) - 4 freq winderful (3) - 2 freq wunnerfa (3) - 1 freq wonderful (3) - 41 freq winderfil (4) - 9 freq wunnderfu (4) - 1 freq wunnerous (4) - 1 freq wunderfu (4) - 1 freq wunnertu (4) - 2 freq wonderfil (4) - 1 freq wonderfu (5) - 4 freq unnerfuit (5) - 1 freq wunnerin' (5) - 1 freq wunnerd (5) - 1 freq wunnerit (5) - 2 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 - WNRFL wunnerful - 7 freq wunnerfuul - 1 freq wunnerful' - 1 freq |
WUNNERFUL |
| Time to execute Levenshtein function - 0.188401 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.449658 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.028135 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.048605 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.001096 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. |