| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wannerin (0) - 9 freq wanderin (1) - 36 freq dannerin (1) - 4 freq rannerin (1) - 1 freq winnerin (1) - 23 freq wunnerin (1) - 83 freq waunerin (1) - 4 freq waunnerin (1) - 3 freq wannerins (1) - 3 freq wonnerin (1) - 9 freq wannerer (2) - 1 freq watherin (2) - 1 freq watterin (2) - 12 freq wandern (2) - 1 freq hennerin (2) - 1 freq wanners (2) - 3 freq wunnering (2) - 2 freq dennerin (2) - 2 freq walterin (2) - 3 freq waterin (2) - 7 freq warderin (2) - 1 freq wanderins (2) - 2 freq winderin (2) - 17 freq danderin (2) - 6 freq wantherin (2) - 2 freq |
wannerin (0) - 9 freq wunnerin (1) - 83 freq winnerin (1) - 23 freq wonnerin (1) - 9 freq waunnerin (1) - 3 freq waunerin (2) - 4 freq wannerins (2) - 3 freq rannerin (2) - 1 freq dannerin (2) - 4 freq wanderin (2) - 36 freq dunnerin (3) - 8 freq unnerin (3) - 1 freq sinnerin (3) - 2 freq wunnerit (3) - 2 freq waanderin (3) - 3 freq wannered (3) - 3 freq wanneret (3) - 1 freq junnerin (3) - 1 freq binnerin (3) - 1 freq wannert (3) - 22 freq jaunnerin (3) - 1 freq wanderan (3) - 2 freq wunnerin' (3) - 1 freq winterin (3) - 1 freq waandrin (3) - 1 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 |
WANNERIN |
| Time to execute Levenshtein function - 0.197388 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.355975 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.028640 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.038039 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.000883 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. |