Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
winner (0) - 143 freq winder (1) - 112 freq binner (1) - 2 freq dinner (1) - 140 freq wiener (1) - 2 freq wonner (1) - 5 freq winger (1) - 3 freq whinner (1) - 1 freq cinner (1) - 1 freq hinner (1) - 46 freq 'winner (1) - 1 freq linner (1) - 2 freq winter (1) - 434 freq wanner (1) - 18 freq sinner (1) - 10 freq winnert (1) - 40 freq winners (1) - 30 freq rinner (1) - 13 freq winnen (1) - 1 freq wunner (1) - 282 freq tinner (1) - 1 freq inner (1) - 46 freq winnerd (1) - 1 freq wunne (2) - 1 freq dinned (2) - 4 freq |
winner (0) - 143 freq wunner (1) - 282 freq wanner (1) - 18 freq wonner (1) - 5 freq winners (2) - 30 freq winnert (2) - 40 freq sinner (2) - 10 freq rinner (2) - 13 freq winnen (2) - 1 freq winnerd (2) - 1 freq wunnur (2) - 1 freq inner (2) - 46 freq tinner (2) - 1 freq wiener (2) - 2 freq dinner (2) - 140 freq winter (2) - 434 freq winder (2) - 112 freq winger (2) - 3 freq binner (2) - 2 freq linner (2) - 2 freq 'winner (2) - 1 freq whinner (2) - 1 freq hinner (2) - 46 freq cinner (2) - 1 freq wagner (3) - 1 freq |
SoundEx code - W560 wann'er - 1 freq winner - 143 freq wunner - 282 freq wummer - 1 freq wanweiry - 1 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wanner - 18 freq whinner - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 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 - 143 freq wunner - 282 freq whane'er - 4 freq wonner - 5 freq wauner - 2 freq 'whin're - 1 freq wanner - 18 freq whinner - 1 freq wunnér - 2 freq 'winner - 1 freq wheneer - 1 freq whene'er - 3 freq wunnèr - 1 freq won'er - 1 freq when'er - 1 freq whanur - 1 freq wunnur - 1 freq wiener - 2 freq |
WINNER win - 980 freq winner - 143 freq winning - 14 freq winnin - 90 freq wins - 78 freq |
Time to execute Levenshtein function - 0.192114 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.406650 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.027602 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.036861 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.000953 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. |