| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cattrick (0) - 1 freq paitrick (2) - 1 freq attick (2) - 1 freq patrick (2) - 32 freq cantick (2) - 1 freq attrack (2) - 4 freq mastrick (2) - 3 freq ettrick (2) - 10 freq mathrick (2) - 1 freq hat-trick (2) - 2 freq carrick (2) - 6 freq cattie (3) - 2 freq contrack (3) - 3 freq kangrick (3) - 6 freq prattick (3) - 18 freq partick (3) - 12 freq restrick (3) - 1 freq cattlie (3) - 2 freq bambrick (3) - 1 freq atrack (3) - 1 freq laevrick (3) - 2 freq cattil (3) - 2 freq cathlics (3) - 2 freq attack (3) - 79 freq wattrin (3) - 1 freq |
cattrick (0) - 1 freq attrack (3) - 4 freq ettrick (3) - 10 freq mathrick (4) - 1 freq contrack (4) - 3 freq etterick (4) - 1 freq hat-trick (4) - 2 freq carrick (4) - 6 freq attick (4) - 1 freq mastrick (4) - 3 freq patrick (4) - 32 freq paitrick (4) - 1 freq cantick (4) - 1 freq attrac (5) - 1 freq districk (5) - 3 freq citric (5) - 2 freq ipatrick (5) - 1 freq trick (5) - 68 freq attack (5) - 79 freq attracks (5) - 1 freq destrick (5) - 3 freq attrak (5) - 1 freq restrick (5) - 1 freq strick (5) - 13 freq attract (5) - 7 freq |
SoundEx code - C362 cattrick - 1 freq chitters - 7 freq catharsis - 1 freq cottaries - 1 freq citris - 3 freq citrus - 1 freq cedars - 1 freq cottars - 19 freq citrusy - 1 freq cottar-hooses - 1 freq catter's - 1 freq cutter's - 1 freq cheeters - 1 freq cataracts - 1 freq cataract - 5 freq cottars' - 3 freq cottar's - 1 freq cottar-hoose - 5 freq citric - 2 freq cheaters - 1 freq cathersmcg - 5 freq cheddars - 1 freq |
MetaPhone code - KTRK cattrick - 1 freq godric - 1 freq |
CATTRICK |
| Time to execute Levenshtein function - 0.294214 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.610824 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.030160 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.077278 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.001251 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. |