| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winnerin (0) - 23 freq wunnerin (1) - 82 freq winterin (1) - 1 freq wonnerin (1) - 9 freq winderin (1) - 17 freq sinnerin (1) - 2 freq binnerin (1) - 1 freq hinnerin (1) - 2 freq wannerin (1) - 9 freq hinnerein (2) - 6 freq dannerin (2) - 4 freq winrin (2) - 2 freq lingerin (2) - 12 freq winners' (2) - 1 freq sinnerie (2) - 1 freq dennerin (2) - 2 freq hennerin (2) - 1 freq winnerd (2) - 1 freq wunderin (2) - 7 freq wannerins (2) - 3 freq windrin (2) - 4 freq unnerin (2) - 1 freq wunnering (2) - 2 freq windering (2) - 1 freq hinnersin (2) - 4 freq |
winnerin (0) - 23 freq wonnerin (1) - 9 freq wannerin (1) - 9 freq wunnerin (1) - 82 freq winterin (2) - 1 freq hinnerin (2) - 2 freq waunnerin (2) - 3 freq binnerin (2) - 1 freq sinnerin (2) - 2 freq winderin (2) - 17 freq dunnerin (3) - 8 freq winnert (3) - 40 freq wintirin (3) - 1 freq winner (3) - 138 freq wunn'rin (3) - 1 freq junnerin (3) - 1 freq winneret (3) - 1 freq waunerin (3) - 4 freq winnerfu (3) - 15 freq wanderin (3) - 35 freq winnen (3) - 1 freq rannerin (3) - 1 freq wonderin (3) - 51 freq hinneren (3) - 43 freq wunnerin' (3) - 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 |
WINNERIN |
| Time to execute Levenshtein function - 0.298159 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.546922 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.058759 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.040318 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.000754 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. |