| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rosy-cheeked (0) - 1 freq reid-cheeked (3) - 3 freq re-checked (4) - 1 freq door-cheek's (5) - 1 freq door-cheek (5) - 3 freq cross-checkit (5) - 1 freq rosy-white (5) - 1 freq screeved (6) - 2 freq tochered (6) - 4 freq reid-checkit (6) - 1 freq sleeked (6) - 2 freq streeked (6) - 1 freq wheeked (6) - 8 freq screened (6) - 1 freq sheened (6) - 1 freq succeeded (6) - 8 freq cross-legged (6) - 2 freq horse-shaeped (6) - 1 freq dry-cleaned (6) - 1 freq rose-bed (6) - 1 freq well-heeled (6) - 1 freq peat-choked (6) - 1 freq creeked (6) - 1 freq slochtered (6) - 1 freq hot-heided (6) - 1 freq |
rosy-cheeked (0) - 1 freq reid-cheeked (4) - 3 freq re-checked (6) - 1 freq rosy-white (8) - 1 freq peat-choked (8) - 1 freq reschuiled (8) - 1 freq door-cheek (8) - 3 freq rose-bed (9) - 1 freq snochered (9) - 1 freq horse-shaeped (9) - 1 freq snichered (9) - 2 freq ischewed (9) - 1 freq reid-heided (9) - 3 freq eschewed (9) - 2 freq rossauchenree (9) - 9 freq stachered (9) - 4 freq resairched (9) - 1 freq researched (9) - 2 freq cross-checkit (9) - 1 freq door-cheek's (9) - 1 freq escheved (9) - 1 freq reid-checkit (9) - 1 freq rochled (9) - 2 freq rocked (9) - 6 freq rug-sooked (10) - 1 freq |
SoundEx code - R222 roughcast - 2 freq recesses - 4 freq rosy-cheeked - 1 freq rough-cast - 1 freq richsauces - 1 freq rxghkhgnjm - 1 freq |
MetaPhone code - RSXKT rosy-cheeked - 1 freq |
ROSY-CHEEKED |
| Time to execute Levenshtein function - 0.297534 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.601001 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.037330 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.086642 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.001230 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. |