| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| catches (0) - 31 freq catched (1) - 83 freq matches (1) - 41 freq hatches (1) - 4 freq patches (1) - 20 freq catchers (1) - 1 freq catchet (1) - 5 freq ratches (1) - 1 freq watches (1) - 29 freq latches (1) - 2 freq catche's (1) - 1 freq catcher (1) - 2 freq catchen (1) - 2 freq vratches (2) - 5 freq ecatched (2) - 1 freq matched (2) - 8 freq eatched (2) - 1 freq lathes (2) - 1 freq creches (2) - 1 freq watchers (2) - 11 freq catchie (2) - 2 freq catchin (2) - 52 freq catcht (2) - 37 freq hatchets (2) - 1 freq satchel (2) - 8 freq |
catches (0) - 31 freq watches (2) - 29 freq latches (2) - 2 freq catchen (2) - 2 freq ratches (2) - 1 freq catcher (2) - 2 freq catche's (2) - 1 freq matches (2) - 41 freq catchet (2) - 5 freq hatches (2) - 4 freq catched (2) - 83 freq catchers (2) - 1 freq patches (2) - 20 freq coaches (3) - 9 freq paitches (3) - 1 freq notches (3) - 1 freq taiches (3) - 1 freq couches (3) - 2 freq catchan (3) - 12 freq hitches (3) - 2 freq pitches (3) - 14 freq clutches (3) - 4 freq catchup (3) - 1 freq waatches (3) - 7 freq scutches (3) - 1 freq |
SoundEx code - C322 catches - 31 freq catechism - 5 freq cottages - 30 freq catche's - 1 freq co-design - 4 freq catecheezin - 1 freq catechisms - 2 freq cod-sweech - 1 freq catakehisdrink - 1 freq cduissiqx - 1 freq citycycling - 1 freq |
MetaPhone code - KXS coaches - 9 freq catches - 31 freq keechs - 1 freq quaichs - 4 freq catche's - 1 freq gushes - 5 freq cautious - 8 freq cowshus - 5 freq kishies - 4 freq cochise - 5 freq cowtious - 1 freq coach's - 1 freq coshes - 1 freq couches - 2 freq kechs - 1 freq |
CATCHES |
| Time to execute Levenshtein function - 0.197738 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.356840 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.027514 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.037975 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.000798 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. |