| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winner (0) - 138 freq winder (1) - 112 freq winter (1) - 427 freq cinner (1) - 1 freq winnerd (1) - 1 freq wiener (1) - 2 freq winnen (1) - 1 freq dinner (1) - 130 freq wanner (1) - 17 freq winger (1) - 3 freq wonner (1) - 5 freq winners (1) - 30 freq 'winner (1) - 1 freq winnert (1) - 40 freq tinner (1) - 1 freq inner (1) - 44 freq wunner (1) - 281 freq linner (1) - 2 freq rinner (1) - 13 freq hinner (1) - 46 freq sinner (1) - 10 freq binner (1) - 2 freq winny (2) - 7 freq winders (2) - 3 freq hinder (2) - 20 freq |
winner (0) - 138 freq wonner (1) - 5 freq wunner (1) - 281 freq wanner (1) - 17 freq tinner (2) - 1 freq inner (2) - 44 freq rinner (2) - 13 freq binner (2) - 2 freq wunnur (2) - 1 freq hinner (2) - 46 freq winnert (2) - 40 freq linner (2) - 2 freq sinner (2) - 10 freq winnerd (2) - 1 freq cinner (2) - 1 freq winder (2) - 112 freq 'winner (2) - 1 freq wiener (2) - 2 freq winter (2) - 427 freq winners (2) - 30 freq winnen (2) - 1 freq winger (2) - 3 freq dinner (2) - 130 freq tenner (3) - 25 freq manner (3) - 18 freq |
SoundEx code - W560 wann'er - 1 freq winner - 138 freq wunner - 281 freq wummer - 1 freq wanweiry - 1 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wanner - 17 freq wunnèr - 1 freq won'er - 1 freq wun'ner - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq win-ower - 1 freq weimar - 1 freq wnar - 1 freq |
MetaPhone code - WNR wann'er - 1 freq winner - 138 freq wunner - 281 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wanner - 17 freq wunnèr - 1 freq won'er - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq |
WINNER win - 977 freq winner - 138 freq winning - 13 freq winnin - 88 freq wins - 78 freq |
| Time to execute Levenshtein function - 0.270923 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.429226 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.027026 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.037215 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.000817 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. |