| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunnerin (0) - 82 freq wunderin (1) - 7 freq wonnerin (1) - 9 freq wunnering (1) - 2 freq wunn'rin (1) - 1 freq dunnerin (1) - 8 freq junnerin (1) - 1 freq winnerin (1) - 23 freq wunnerin' (1) - 1 freq wunnerit (1) - 2 freq waunnerin (1) - 3 freq unnerin (1) - 1 freq wannerin (1) - 9 freq winterin (2) - 1 freq waunerin (2) - 4 freq binnerin (2) - 1 freq wunnerfa (2) - 1 freq dannerin (2) - 4 freq wunnertu (2) - 2 freq hennerin (2) - 1 freq wonderin (2) - 51 freq wunnèrin (2) - 5 freq wuntherin (2) - 1 freq wannerins (2) - 3 freq dennerin (2) - 2 freq |
wunnerin (0) - 82 freq waunnerin (1) - 3 freq winnerin (1) - 23 freq wannerin (1) - 9 freq wonnerin (1) - 9 freq dunnerin (2) - 8 freq wunn'rin (2) - 1 freq wunderin (2) - 7 freq wunnerit (2) - 2 freq unnerin (2) - 1 freq wunnering (2) - 2 freq junnerin (2) - 1 freq wunnerin' (2) - 1 freq wunners (3) - 21 freq jaunnerin (3) - 1 freq rannerin (3) - 1 freq wunnerd (3) - 1 freq wunnerfu (3) - 56 freq wunnert (3) - 28 freq daunnerin (3) - 2 freq wunnerlan (3) - 4 freq won'erin (3) - 1 freq wunner (3) - 281 freq wunnin (3) - 10 freq wanderin (3) - 35 freq |
SoundEx code - W565 waunnerin - 3 freq wannerins - 3 freq wunnerin - 82 freq wunnering - 2 freq waunerin - 4 freq wannerin - 9 freq winnerin - 23 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 - 82 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 |
WUNNERIN |
| Time to execute Levenshtein function - 0.183867 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.348027 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.027038 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.037121 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.000826 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. |