| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cathcher (0) - 1 freq catcher (1) - 2 freq catchen (2) - 2 freq catches (2) - 34 freq catched (2) - 83 freq catchet (2) - 5 freq catchers (2) - 1 freq watcher (2) - 1 freq patches (3) - 22 freq eatched (3) - 1 freq catchit (3) - 8 freq cancer (3) - 43 freq watched (3) - 259 freq cashier (3) - 1 freq butcher (3) - 36 freq catch (3) - 353 freq watches (3) - 29 freq thatcher (3) - 24 freq matches (3) - 41 freq fatther (3) - 3 freq laicher (3) - 5 freq ecatched (3) - 1 freq choocher (3) - 1 freq acher (3) - 1 freq cawther (3) - 1 freq |
cathcher (0) - 1 freq catcher (2) - 2 freq catchers (4) - 1 freq catchet (4) - 5 freq watcher (4) - 1 freq choocher (4) - 1 freq catchen (4) - 2 freq catched (4) - 83 freq catches (4) - 34 freq hatchery (5) - 2 freq ticher (5) - 3 freq catchie (5) - 2 freq stacher (5) - 3 freq gutcher (5) - 1 freq cotched (5) - 6 freq taicher (5) - 3 freq catchup (5) - 1 freq cither (5) - 1 freq tocher (5) - 25 freq catchan (5) - 12 freq catchy (5) - 3 freq clincher (5) - 2 freq catchin (5) - 55 freq pitcher (5) - 1 freq butcher (5) - 36 freq |
SoundEx code - C326 catcher - 2 freq codger - 2 freq category - 23 freq cadger - 5 freq cottagers - 2 freq cathcart - 4 freq cadgers - 1 freq categories - 13 freq catchwords - 1 freq cathcher - 1 freq categorise - 1 freq categorised - 2 freq categorisation - 1 freq catchers - 1 freq cadger's - 1 freq cadgier - 1 freq categoreesed - 2 freq cuddy-cairt - 1 freq caitegories - 1 freq cdocaurdt - 1 freq codgers - 1 freq catjarman - 1 freq |
MetaPhone code - K0XR cathcher - 1 freq |
CATHCHER |
| Time to execute Levenshtein function - 0.229893 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.384228 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.030111 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.043537 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.001047 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. |