| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redshank (0) - 3 freq reidshank (1) - 1 freq redeshanks (2) - 1 freq redd-hann (3) - 1 freq rashan (3) - 2 freq redskins (3) - 2 freq reshape (3) - 1 freq rethink (3) - 2 freq trevshan (3) - 1 freq reachan (3) - 3 freq restan (3) - 4 freq shank (3) - 22 freq tredsman (3) - 3 freq bethank (3) - 1 freq redpath (4) - 2 freq resign (4) - 2 freq sensan (4) - 1 freq clashan (4) - 2 freq bashans (4) - 1 freq feishen (4) - 8 freq reliant (4) - 3 freq rushin' (4) - 1 freq remark (4) - 43 freq feehan (4) - 1 freq respin (4) - 1 freq |
redshank (0) - 3 freq reidshank (1) - 1 freq redeshanks (3) - 1 freq rethink (5) - 2 freq shank (5) - 22 freq redskins (5) - 2 freq rashan (5) - 2 freq roushian (6) - 1 freq rushing (6) - 2 freq cruikshank (6) - 4 freq rushin (6) - 16 freq ramshin (6) - 3 freq relishin (6) - 2 freq rooshian (6) - 1 freq oerthink (6) - 1 freq rushin' (6) - 1 freq dashan (6) - 1 freq rookshanks (6) - 1 freq rdsbzk (6) - 1 freq trevshan (6) - 1 freq bethank (6) - 1 freq restan (6) - 4 freq reachan (6) - 3 freq tredsman (6) - 3 freq redd-hann (6) - 1 freq |
SoundEx code - R325 roads-same - 1 freq rewatchin - 2 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 - RTXNK redshank - 3 freq reidshank - 1 freq |
REDSHANK |
| Time to execute Levenshtein function - 0.230220 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.376862 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.027546 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.039227 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.000915 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. |