| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waunnerin (0) - 3 freq waunerin (1) - 4 freq wannerin (1) - 9 freq jaunnerin (1) - 1 freq wunnerin (1) - 83 freq daunnerin (1) - 2 freq dunnerin (2) - 8 freq wunn'rin (2) - 1 freq rannerin (2) - 1 freq waanderin (2) - 3 freq daunerin (2) - 30 freq winnerin (2) - 23 freq wonnerin (2) - 9 freq aunterin (2) - 1 freq wunnering (2) - 2 freq unnerin (2) - 1 freq wannerins (2) - 3 freq wunnerin' (2) - 1 freq waunners (2) - 2 freq wanderin (2) - 36 freq waunnerfu (2) - 1 freq plunnerin (2) - 1 freq dannerin (2) - 4 freq saunterin (2) - 5 freq daunderin (2) - 14 freq |
waunnerin (0) - 3 freq wunnerin (1) - 83 freq wannerin (1) - 9 freq wonnerin (2) - 9 freq winnerin (2) - 23 freq daunnerin (2) - 2 freq jaunnerin (2) - 1 freq waunerin (2) - 4 freq dannerin (3) - 4 freq waunnerfu (3) - 1 freq wanderin (3) - 36 freq waunnert (3) - 6 freq waunners (3) - 2 freq wunnerit (3) - 2 freq wunderin (3) - 7 freq junnerin (3) - 1 freq wunnerin' (3) - 1 freq rannerin (3) - 1 freq dunnerin (3) - 8 freq waanderin (3) - 3 freq wunnering (3) - 2 freq wannerins (3) - 3 freq unnerin (3) - 1 freq wunn'rin (3) - 1 freq wunnertu (4) - 2 freq |
SoundEx code - W565 waunnerin - 3 freq wannerins - 3 freq wunnerin - 83 freq wunnering - 2 freq waunerin - 4 freq wannerin - 9 freq winnerin - 23 freq wanrnin - 1 freq wonnerin - 9 freq winnermint - 1 freq wunnerment - 2 freq wunnèrin - 5 freq won'erin - 1 freq wunnérin - 1 freq wunn'rin - 1 freq winrin - 2 freq wanerin' - 1 freq wunnerin' - 1 freq waynerooney - 1 freq whenuryoung - 1 freq |
MetaPhone code - WNRN waunnerin - 3 freq wunnerin - 83 freq waunerin - 4 freq wannerin - 9 freq winnerin - 23 freq wonnerin - 9 freq wunnèrin - 5 freq won'erin - 1 freq wunnérin - 1 freq wunn'rin - 1 freq winrin - 2 freq wanerin' - 1 freq wunnerin' - 1 freq waynerooney - 1 freq |
WAUNNERIN |
| Time to execute Levenshtein function - 0.221403 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.384818 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.028109 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.038077 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.000910 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. |