| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| patriarch (0) - 11 freq matriarch (1) - 2 freq patriarchy (1) - 5 freq patriarchal (2) - 3 freq patriarchis (2) - 1 freq parritch (3) - 66 freq tetrarch (3) - 6 freq patrick (3) - 32 freq patriots (4) - 2 freq attach (4) - 7 freq starch (4) - 1 freq parlance (4) - 2 freq praech (4) - 2 freq larach (4) - 1 freq porritch (4) - 7 freq patricio (4) - 1 freq atrack (4) - 1 freq garioch (4) - 19 freq pairth (4) - 1 freq airch (4) - 12 freq partitch (4) - 1 freq pairritch (4) - 1 freq poarch (4) - 1 freq parkash (4) - 1 freq parish (4) - 30 freq |
patriarch (0) - 11 freq patriarchy (1) - 5 freq matriarch (2) - 2 freq patriarchis (3) - 1 freq patriarchal (3) - 3 freq tetrarch (4) - 6 freq patrick (5) - 32 freq parritch (5) - 66 freq preach (6) - 16 freq straech (6) - 1 freq garrioch (6) - 1 freq patriotic (6) - 11 freq paroch (6) - 2 freq patricia (6) - 21 freq ipatrick (6) - 1 freq farrach (6) - 1 freq patch (6) - 74 freq ostrich (6) - 1 freq tarreoch (6) - 2 freq ootreach (6) - 9 freq praich (6) - 10 freq strach (6) - 1 freq stairch (6) - 1 freq paitrick (6) - 1 freq purritch (6) - 3 freq |
SoundEx code - P366 patriarchy - 5 freq patriarch - 11 freq patriarchal - 3 freq poutrie-rie - 1 freq patriarchis - 1 freq pooderhorn - 1 freq peatworrier - 18 freq peterhart - 1 freq peterweirmla - 1 freq |
MetaPhone code - PTRRX patriarchy - 5 freq patriarch - 11 freq |
PATRIARCH |
| Time to execute Levenshtein function - 0.181926 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.476628 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.029440 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.069557 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.000967 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. |