| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| checker (0) - 5 freq checket (1) - 2 freq checked (1) - 84 freq chekker (1) - 1 freq decker (2) - 12 freq checks (2) - 12 freq chucken (2) - 17 freq chepper (2) - 1 freq cheer (2) - 153 freq chicked (2) - 1 freq fecker (2) - 14 freq cheater (2) - 1 freq thicker (2) - 11 freq chechen (2) - 1 freq blecker (2) - 2 freq checky (2) - 3 freq wheeker (2) - 25 freq chester (2) - 1 freq chowker (2) - 7 freq checkin (2) - 44 freq shocker (2) - 4 freq choaker (2) - 7 freq heckers (2) - 1 freq chirker (2) - 1 freq chocked (2) - 3 freq |
checker (0) - 5 freq checked (2) - 84 freq chekker (2) - 1 freq checket (2) - 2 freq chucket (3) - 3 freq checkit (3) - 20 freq choker (3) - 1 freq cracker (3) - 44 freq chirker (3) - 1 freq checkan (3) - 3 freq chocked (3) - 3 freq chacked (3) - 2 freq clocker (3) - 3 freq chucked (3) - 28 freq check (3) - 202 freq chicken (3) - 82 freq checkt (3) - 5 freq chuckers (3) - 1 freq cocker (3) - 1 freq choaker (3) - 7 freq whacker (3) - 1 freq chunker (3) - 1 freq thicker (3) - 11 freq checky (3) - 3 freq chicked (3) - 1 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - XKR choaker - 7 freq chowker - 7 freq shocker - 4 freq shugar - 1 freq shuggar - 6 freq checker - 5 freq shugger - 4 freq choker - 1 freq shuggary - 1 freq chakra - 1 freq shaker - 1 freq shagger - 1 freq chekker - 1 freq |
CHECKER |
| Time to execute Levenshtein function - 0.206970 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.332771 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.026912 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.039404 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.001139 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. |