| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rudkintheref (0) - 2 freq wunthered (5) - 1 freq wuntherin (6) - 1 freq mutthered (6) - 1 freq wunther (6) - 2 freq doun-here (6) - 1 freq murthered (6) - 3 freq juntherin (6) - 3 freq unther (6) - 9 freq wunthers (6) - 1 freq gaithered (6) - 70 freq wintered (6) - 2 freq wuthered (6) - 2 freq ainther (6) - 3 freq blintered (6) - 2 freq wunnther (6) - 1 freq guidmither (6) - 3 freq daither (6) - 1 freq faithered (6) - 3 freq inther (6) - 1 freq swithered (6) - 9 freq dither (6) - 2 freq registered (6) - 16 freq intherest (6) - 6 freq gaitheren (6) - 8 freq |
rudkintheref (0) - 2 freq dinnther (9) - 1 freq rockin-horse (9) - 1 freq redkingcraw (9) - 1 freq dunthers (9) - 1 freq wunthered (9) - 1 freq rudkin (10) - 2 freq ilkither (10) - 6 freq ruther (10) - 3 freq doon-here (10) - 1 freq kintore (10) - 4 freq godmither (10) - 3 freq founthered (10) - 2 freq hinther (10) - 1 freq midwinter (10) - 3 freq dithert (10) - 1 freq kintyre (10) - 4 freq nithered (10) - 1 freq rither (10) - 6 freq rudimentary (10) - 2 freq raither (10) - 273 freq rethered (10) - 1 freq scunthered (10) - 1 freq dithery (10) - 1 freq guidmither (10) - 3 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 - RTKN0RF rudkintheref - 2 freq |
RUDKINTHEREF |
| Time to execute Levenshtein function - 0.370100 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.501848 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.027924 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.040135 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.001270 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. |