| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whinner (0) - 1 freq whinned (1) - 1 freq shinner (1) - 1 freq winner (1) - 143 freq whinney (1) - 1 freq hinner (1) - 46 freq thinner (1) - 14 freq hinder (2) - 20 freq cinner (2) - 1 freq shinnel (2) - 2 freq wanner (2) - 18 freq sinner (2) - 10 freq inner (2) - 46 freq binner (2) - 2 freq wiener (2) - 2 freq henner (2) - 3 freq thunner (2) - 74 freq 'winner (2) - 1 freq winnen (2) - 1 freq whined (2) - 3 freq hinger (2) - 6 freq hinners (2) - 5 freq hinnert (2) - 3 freq whinge (2) - 2 freq thonner (2) - 45 freq |
whinner (0) - 1 freq hinner (2) - 46 freq thinner (2) - 14 freq whinney (2) - 1 freq whinned (2) - 1 freq winner (2) - 143 freq shinner (2) - 1 freq whinever (3) - 3 freq shanner (3) - 1 freq whinny (3) - 6 freq chinnery (3) - 1 freq hunner (3) - 442 freq whiniver (3) - 3 freq whinniet (3) - 1 freq when'er (3) - 1 freq wonner (3) - 5 freq whinnied (3) - 3 freq 'hunner (3) - 2 freq wheneer (3) - 1 freq shunner (3) - 2 freq thonner (3) - 45 freq ahunner (3) - 1 freq wunner (3) - 282 freq wanner (3) - 18 freq thunner (3) - 74 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 |
WHINNER |
| Time to execute Levenshtein function - 0.261758 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.402223 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.034876 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.041295 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.000853 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. |