| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tetrarch (0) - 6 freq terrace (3) - 24 freq teach (3) - 86 freq tetror (3) - 1 freq patriarch (3) - 11 freq thratch (3) - 1 freq straech (3) - 1 freq seraich (3) - 1 freq detract (3) - 2 freq terah (3) - 3 freq matriarch (3) - 2 freq search (3) - 116 freq strach (3) - 1 freq research (3) - 166 freq detrack (3) - 1 freq feerach (3) - 3 freq retrace (3) - 1 freq starch (3) - 1 freq thatch (4) - 5 freq seraicht (4) - 2 freq dearth (4) - 9 freq betrayan (4) - 1 freq fearce (4) - 1 freq franch (4) - 1 freq dearbh (4) - 1 freq |
tetrarch (0) - 6 freq patriarch (4) - 11 freq matriarch (4) - 2 freq strach (5) - 1 freq starch (5) - 1 freq patriarchy (5) - 5 freq tarreoch (5) - 2 freq straech (5) - 1 freq terrace (5) - 24 freq thratch (5) - 1 freq tetror (5) - 1 freq dietrich (6) - 2 freq troch (6) - 13 freq teethache (6) - 2 freq ostrich (6) - 1 freq farrach (6) - 1 freq owerairch (6) - 1 freq torch (6) - 27 freq stairch (6) - 1 freq trurh (6) - 1 freq borrach (6) - 1 freq attach (6) - 7 freq throuch (6) - 16 freq attract (6) - 7 freq streech (6) - 13 freq |
SoundEx code - T366 tetror - 1 freq tetrarch - 6 freq thedrawer - 1 freq |
MetaPhone code - TTRRX tetrarch - 6 freq |
TETRARCH |
| Time to execute Levenshtein function - 0.211970 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.383121 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.037840 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.049675 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.001219 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. |