| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waunerin (0) - 4 freq daunerin (1) - 30 freq waunnerin (1) - 3 freq wannerin (1) - 9 freq daanerin (2) - 1 freq daunderin (2) - 14 freq dannerin (2) - 4 freq saunterin (2) - 5 freq waterin (2) - 7 freq daunnerin (2) - 2 freq wandrin (2) - 1 freq launderin (2) - 2 freq wunnerin (2) - 82 freq winnerin (2) - 23 freq waukenin (2) - 7 freq watterin (2) - 12 freq walterin (2) - 3 freq wunderin (2) - 7 freq waandrin (2) - 1 freq wauner (2) - 2 freq aunterin (2) - 1 freq wannerins (2) - 3 freq wauntin (2) - 2 freq waunert (2) - 6 freq wauners (2) - 1 freq |
waunerin (0) - 4 freq daunerin (2) - 30 freq wannerin (2) - 9 freq waunnerin (2) - 3 freq waunert (3) - 6 freq wauntin (3) - 2 freq lounerin (3) - 1 freq waandrin (3) - 1 freq wauner (3) - 2 freq wanderin (3) - 35 freq waanderin (3) - 3 freq wunderin (3) - 7 freq wonnerin (3) - 9 freq wanerin' (3) - 1 freq wauners (3) - 1 freq waterin (3) - 7 freq wandrin (3) - 1 freq winrin (3) - 2 freq wunnerin (3) - 82 freq daanerin (3) - 1 freq winnerin (3) - 23 freq wandern (4) - 1 freq wairin (4) - 1 freq foonerin (4) - 1 freq warrin (4) - 1 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 |
WAUNERIN |
| Time to execute Levenshtein function - 0.206489 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.428556 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.028712 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.039141 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.000879 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. |