| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mattathias (0) - 4 freq mattathiah (1) - 2 freq mattatha (2) - 3 freq matthat (4) - 4 freq marathons (4) - 4 freq attachit (4) - 1 freq mattha's (4) - 1 freq matthan (4) - 4 freq mattha (4) - 22 freq aathins (4) - 3 freq mattirs (4) - 1 freq attaches (4) - 1 freq matties (4) - 1 freq matta (5) - 1 freq marrasis (5) - 1 freq teachins (5) - 4 freq attitudes (5) - 31 freq aathing (5) - 176 freq catties (5) - 3 freq mahatma (5) - 1 freq sympathies (5) - 1 freq muntains (5) - 33 freq cantata (5) - 1 freq mairtins (5) - 1 freq apathy's (5) - 2 freq |
mattathias (0) - 4 freq mattathiah (2) - 2 freq mattatha (3) - 3 freq mattirs (6) - 1 freq attaches (6) - 1 freq meltiths (6) - 1 freq mattha (6) - 22 freq matties (6) - 1 freq matthan (6) - 4 freq matthat (6) - 4 freq mattha's (6) - 1 freq matthew (7) - 139 freq matches (7) - 41 freq matthey (7) - 2 freq meethis (7) - 1 freq antipathies (7) - 6 freq mattit (7) - 3 freq mutatit (7) - 1 freq motthors (7) - 2 freq matatt (7) - 2 freq maitter's (7) - 3 freq straths (7) - 11 freq mammoths (7) - 3 freq matters (7) - 27 freq matther (7) - 2 freq |
SoundEx code - M332 methodists - 1 freq mattathias - 4 freq methodical - 1 freq metadist - 3 freq methods - 8 freq motets - 3 freq mediates - 1 freq methodicallie - 1 freq |
MetaPhone code - MT0S mattathias - 4 freq |
MATTATHIAS |
| Time to execute Levenshtein function - 0.188287 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.373572 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.028953 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.042708 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.000960 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. |