| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reid-faced (0) - 3 freq rid-faced (1) - 4 freq reed-faced (1) - 6 freq ridd-faced (2) - 2 freq resurfaced (3) - 2 freq bold-faced (3) - 1 freq rock-faced (3) - 1 freq fresh-faced (3) - 3 freq fair-faced (3) - 3 freq din-faced (3) - 1 freq roun-faced (3) - 1 freq reid-robed (3) - 1 freq green-faced (3) - 1 freq grim-faced (3) - 2 freq steen-faced (4) - 1 freq stern-faced (4) - 1 freq torn-faced (4) - 4 freq reid-wud (4) - 3 freq wart-faced (4) - 2 freq reid-heided (4) - 2 freq grimfaced (4) - 1 freq resurface (4) - 1 freq reid-avised (4) - 1 freq reid-tap (4) - 1 freq blae-faced (4) - 2 freq |
reid-faced (0) - 3 freq reed-faced (1) - 6 freq rid-faced (1) - 4 freq ridd-faced (3) - 2 freq roun-faced (4) - 1 freq reid-robed (5) - 1 freq green-faced (5) - 1 freq din-faced (5) - 1 freq grim-faced (5) - 2 freq fair-faced (5) - 3 freq bold-faced (5) - 1 freq rock-faced (5) - 1 freq resurfaced (5) - 2 freq baw-faced (6) - 1 freq girnie-faced (6) - 1 freq twae-faced (6) - 1 freq bare-faced (6) - 4 freq rid-haired (6) - 1 freq twa-faced (6) - 3 freq baa-faced (6) - 1 freq reduced (6) - 25 freq fite-faced (6) - 1 freq frug-faced (6) - 1 freq soor-faced (6) - 4 freq side-face (6) - 1 freq |
SoundEx code - R312 reid-faced - 3 freq reid-avised - 1 freq reed-faced - 6 freq ridd-faced - 2 freq rid-faced - 4 freq reid-fuskered - 1 freq ratification - 2 freq ratifees - 1 freq ratbag - 2 freq rothfusforpa - 1 freq rdvctkcptt - 1 freq rtvcxy - 1 freq |
MetaPhone code - RTFST reid-faced - 3 freq reid-avised - 1 freq reed-faced - 6 freq ridd-faced - 2 freq rid-faced - 4 freq |
REID-FACED |
| Time to execute Levenshtein function - 0.195252 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.353838 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.027555 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.037120 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.000812 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. |