| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redskins (0) - 2 freq reddins (2) - 1 freq reasins (2) - 1 freq resins (2) - 1 freq reakin' (3) - 1 freq reestin (3) - 1 freq renderins (3) - 3 freq ileskins (3) - 2 freq resin (3) - 6 freq reducin (3) - 3 freq merkins (3) - 1 freq gerkins (3) - 1 freq aeylskins (3) - 1 freq reasons (3) - 80 freq 'skins (3) - 1 freq risking (3) - 3 freq newsins (3) - 4 freq raisins (3) - 10 freq rudkin (3) - 2 freq reekin' (3) - 2 freq reishils (3) - 1 freq reddin (3) - 60 freq reasin (3) - 2 freq reikin (3) - 2 freq restis (3) - 1 freq |
redskins (0) - 2 freq reddins (4) - 1 freq resins (4) - 1 freq reasins (4) - 1 freq risslins (5) - 1 freq reckons (5) - 8 freq respons (5) - 1 freq raisins (5) - 10 freq redshank (5) - 3 freq risins (5) - 2 freq riskin (5) - 5 freq deerskins (5) - 1 freq skins (5) - 21 freq roadsigns (5) - 2 freq resigns (5) - 1 freq erskine (5) - 12 freq rudkin (5) - 2 freq oilskins (5) - 1 freq ileskins (5) - 2 freq risking (5) - 3 freq rankins (5) - 3 freq readins (5) - 15 freq aeylskins (5) - 1 freq 'skins (5) - 1 freq siskins (5) - 2 freq |
SoundEx code - R325 roads-same - 1 freq rewatchin - 1 freq rathsmen - 1 freq retchin - 2 freq reid-centred - 1 freq retching - 1 freq ritson - 1 freq ràitheachan - 1 freq radgieness - 1 freq reducin - 3 freq redshank - 3 freq redskins - 2 freq rudkin - 2 freq rudkintheref - 2 freq radiojonnie - 1 freq royhodgson - 1 freq ritchiem - 1 freq radiosmiffy - 2 freq reidshank - 1 freq redkingcraw - 1 freq ratqueen - 1 freq ritheshmsdi - 1 freq redeshanks - 1 freq 'redeshanks' - 1 freq |
MetaPhone code - RTSKNS roadsigns - 2 freq road-signs - 1 freq redskins - 2 freq |
REDSKINS |
| Time to execute Levenshtein function - 0.247366 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.422286 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.029512 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.040777 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.000924 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. |