| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waunnerfu (0) - 1 freq wunnerfu (1) - 56 freq wonnerfu (2) - 3 freq waunnert (2) - 6 freq wunderfu (2) - 1 freq scunnerfu (2) - 1 freq waunnerin (2) - 3 freq wunnerful (2) - 7 freq wunnerfa (2) - 1 freq wunnertu (2) - 2 freq winnerfu (2) - 15 freq waunners (2) - 2 freq wunnderfu (2) - 1 freq wunnerful' (3) - 1 freq wunnerous (3) - 1 freq wonderfu (3) - 4 freq wanners (3) - 3 freq baunner (3) - 5 freq waunter's (3) - 1 freq waunerin (3) - 4 freq wunners (3) - 21 freq wauners (3) - 1 freq wunnerd (3) - 1 freq wunnèrfu (3) - 3 freq wanneret (3) - 1 freq |
waunnerfu (0) - 1 freq wunnerfu (1) - 56 freq winnerfu (2) - 15 freq wunnerfa (2) - 1 freq wonnerfu (2) - 3 freq wunnertu (3) - 2 freq wunnerfae (3) - 4 freq waunners (3) - 2 freq wunnderfu (3) - 1 freq waunnert (3) - 6 freq wunnerful (3) - 7 freq wunderfu (3) - 1 freq waunnerin (3) - 3 freq wonnerfu' (4) - 1 freq wunner (4) - 281 freq wunnerin (4) - 82 freq wunnert (4) - 28 freq wunnerit (4) - 2 freq wannered (4) - 3 freq wannerer (4) - 1 freq wunnered (4) - 43 freq wanner (4) - 17 freq wannert (4) - 22 freq wunnerfuul (4) - 1 freq wannerin (4) - 9 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 |
WAUNNERFU |
| Time to execute Levenshtein function - 0.223421 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.389280 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.036293 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.040346 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.000841 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. |