| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rithmatick (0) - 3 freq rickmatick (2) - 1 freq mathematick (3) - 1 freq arithmetic (3) - 6 freq rheumaticky (4) - 2 freq rheumatics (4) - 4 freq otamatic (4) - 1 freq prismatic (4) - 1 freq fitzpatrick (4) - 1 freq thematic (4) - 4 freq automatic (4) - 11 freq cinematic (4) - 2 freq automatik (4) - 1 freq mathematics (4) - 7 freq idomatic (4) - 1 freq estimation (5) - 1 freq vitiatit (5) - 1 freq stamick (5) - 1 freq lithuanian (5) - 1 freq lithuania (5) - 1 freq haithmaist (5) - 1 freq sitiation (5) - 1 freq rhythmic (5) - 4 freq methlick (5) - 1 freq pneumatic (5) - 1 freq |
rithmatick (0) - 3 freq mathematick (4) - 1 freq arithmetic (4) - 6 freq rickmatick (4) - 1 freq rheumaticky (5) - 2 freq thematic (6) - 4 freq mathematics (6) - 7 freq rheumatics (6) - 4 freq automatik (7) - 1 freq rheumatiky (7) - 1 freq mathematical (7) - 4 freq arthritic (7) - 4 freq orthotics (7) - 1 freq automatic (7) - 11 freq otamatic (7) - 1 freq prattick (8) - 18 freq rethink (8) - 2 freq mathematician (8) - 1 freq matchstick (8) - 1 freq nuthatch (8) - 1 freq thick (8) - 227 freq wishmeluck (8) - 1 freq reidhmasach (8) - 1 freq bittock (8) - 10 freq bathetic (8) - 1 freq |
SoundEx code - R353 road-end - 3 freq reid-haundit - 2 freq reidhaundit - 1 freq redeemed - 5 freq rithmatick - 3 freq readmitted - 1 freq readmittance - 1 freq rodent - 4 freq rodents - 2 freq reddened - 1 freq rationed - 4 freq ready-made - 3 freq radiant - 5 freq rid-haunded - 1 freq redundant - 5 freq reedened - 4 freq reid-haindit - 1 freq redundancy - 3 freq raeddened - 1 freq redeemit - 1 freq rydand - 2 freq redoundand - 1 freq reident - 2 freq rotund - 1 freq retained - 2 freq redandwhite - 1 freq redtintedglasses - 1 freq rtomdavies - 1 freq |
MetaPhone code - R0MTK rithmatick - 3 freq |
RITHMATICK |
| Time to execute Levenshtein function - 0.206461 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.378366 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.029937 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.038367 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.000870 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. |