| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reid-centred (0) - 1 freq deid-centre (2) - 1 freq ego-centred (3) - 1 freq sel-centred (3) - 1 freq self-centred (3) - 2 freq reinvented (4) - 1 freq reid-cheeked (4) - 3 freq reid-heided (4) - 3 freq redacted (5) - 3 freq regimented (5) - 1 freq rendered (5) - 5 freq reid-robed (5) - 1 freq reident (5) - 2 freq heid-butted (5) - 1 freq represented (5) - 9 freq reddened (5) - 1 freq reid-faced (5) - 3 freq reid-het (5) - 5 freq epicentres (5) - 1 freq redshedred (5) - 1 freq deid-end (5) - 1 freq residenter (5) - 3 freq reid-avised (5) - 1 freq relented (5) - 4 freq reid-fuskered (5) - 1 freq |
reid-centred (0) - 1 freq deid-centre (4) - 1 freq sel-centred (5) - 1 freq ego-centred (5) - 1 freq self-centred (6) - 2 freq reid-cheeked (7) - 3 freq reid-fuskered (8) - 1 freq de-cultured (8) - 1 freq rid-tongued (8) - 1 freq re-enter (8) - 1 freq centred (8) - 6 freq rid-haired (8) - 1 freq guid-naitured (8) - 2 freq reed-ringed (8) - 1 freq reid-heided (8) - 3 freq reinvented (8) - 1 freq redacted (8) - 3 freq aff-centre (8) - 1 freq guid-natured (8) - 2 freq centered (9) - 1 freq mid-winter (9) - 4 freq west-central (9) - 1 freq road-end (9) - 3 freq rid-haunded (9) - 1 freq rid-rid (9) - 1 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 - RTSNTRT reid-centred - 1 freq |
REID-CENTRED |
| Time to execute Levenshtein function - 0.255071 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.420848 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.027601 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.037859 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.000907 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. |