| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reid-cheeked (0) - 3 freq re-checked (3) - 1 freq rosy-cheeked (3) - 1 freq reid-checkit (3) - 1 freq reid-heided (3) - 3 freq reid-centred (4) - 1 freq reid-faced (5) - 3 freq reid-robed (5) - 1 freq reid-avised (5) - 1 freq reid-heidit (5) - 5 freq redeemed (5) - 5 freq reid-het (5) - 5 freq weel-heeled (5) - 1 freq peat-choked (5) - 1 freq reid-fuskered (5) - 1 freq rid-haired (5) - 1 freq recleeved (5) - 1 freq redshedred (5) - 1 freq well-heeled (5) - 1 freq keichened (5) - 1 freq heichtened (5) - 1 freq enlichtened (6) - 3 freq reid-wud (6) - 3 freq creeked (6) - 1 freq deid-centre (6) - 1 freq |
reid-cheeked (0) - 3 freq rosy-cheeked (4) - 1 freq re-checked (5) - 1 freq reid-heided (5) - 3 freq reid-checkit (5) - 1 freq rid-haired (7) - 1 freq peat-choked (7) - 1 freq reid-centred (7) - 1 freq reid-fuskered (8) - 1 freq reid-faced (8) - 3 freq reid-robed (8) - 1 freq reid-het (8) - 5 freq reid-avised (8) - 1 freq reid-heidit (8) - 5 freq bed-chaumer (9) - 1 freq redacted (9) - 3 freq rid-baunded (9) - 1 freq reached (9) - 135 freq reid-hot (9) - 1 freq pre-cooked (9) - 1 freq reeched (9) - 1 freq reschuiled (9) - 1 freq red-tipped (9) - 1 freq red-carpet (9) - 1 freq rid-heidit (9) - 2 freq |
SoundEx code - R322 ridges - 6 freq reid-checkit - 1 freq reid-cheeked - 3 freq ratches - 1 freq riddoch's - 1 freq radgest - 2 freq redesigned - 1 freq ridgeways - 1 freq retches - 1 freq roadsign - 1 freq roadsigns - 2 freq road-signs - 1 freq radges - 1 freq ritzys - 1 freq radge-check - 1 freq reduces - 1 freq rtxgqycobj - 1 freq radishes - 1 freq |
MetaPhone code - RTXKT reid-checkit - 1 freq reid-cheeked - 3 freq |
REID-CHEEKED |
| Time to execute Levenshtein function - 0.355254 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.512463 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.029224 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.041192 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.001008 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. |