| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wonnerin (0) - 9 freq wannerin (1) - 9 freq wonderin (1) - 51 freq wunnerin (1) - 82 freq won'erin (1) - 1 freq winnerin (1) - 23 freq wunderin (2) - 7 freq wunnerit (2) - 2 freq conterin (2) - 6 freq wunnerin' (2) - 1 freq waunnerin (2) - 3 freq hinnerin (2) - 2 freq wonner (2) - 5 freq junnerin (2) - 1 freq dennerin (2) - 2 freq connerik (2) - 2 freq dunnerin (2) - 8 freq wondering (2) - 12 freq foonerin (2) - 1 freq wunn'rin (2) - 1 freq unnerin (2) - 1 freq waunerin (2) - 4 freq joinerin (2) - 1 freq wonners (2) - 1 freq wunnering (2) - 2 freq |
wonnerin (0) - 9 freq wunnerin (1) - 82 freq wannerin (1) - 9 freq winnerin (1) - 23 freq waunnerin (2) - 3 freq won'erin (2) - 1 freq wonderin (2) - 51 freq binnerin (3) - 1 freq winterin (3) - 1 freq hennerin (3) - 1 freq dannerin (3) - 4 freq wunnering (3) - 2 freq sinnerin (3) - 2 freq rannerin (3) - 1 freq wanderin (3) - 35 freq wondrin (3) - 1 freq wannerins (3) - 3 freq wonnerfu (3) - 3 freq wonners (3) - 1 freq wonnert (3) - 11 freq wonderan (3) - 7 freq winderin (3) - 17 freq junnerin (3) - 1 freq wunnerit (3) - 2 freq wonner (3) - 5 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 |
WONNERIN |
| Time to execute Levenshtein function - 0.201514 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.345325 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.027163 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.038305 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.000925 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. |