| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| categories (0) - 13 freq caitegories (1) - 1 freq categorise (2) - 1 freq categorised (2) - 2 freq calories (3) - 11 freq categoreesed (3) - 2 freq category (3) - 23 freq kateforbes (3) - 2 freq wateries (3) - 1 freq catalonie (4) - 1 freq caunopies (4) - 1 freq memories (4) - 110 freq meemories (4) - 1 freq tories (4) - 117 freq cairries (4) - 36 freq cargoes (4) - 2 freq agonies (4) - 1 freq calvaries (4) - 1 freq factories (4) - 12 freq vagaries (4) - 1 freq tapestries (4) - 1 freq catering (4) - 1 freq casenotes (4) - 1 freq caterer (4) - 1 freq caries (4) - 1 freq |
categories (0) - 13 freq caitegories (1) - 1 freq categorise (2) - 1 freq categorised (3) - 2 freq category (4) - 23 freq categoreesed (4) - 2 freq caterers (5) - 1 freq wateries (5) - 1 freq cottaries (5) - 1 freq calories (5) - 11 freq centeries (6) - 1 freq toories (6) - 3 freq cherries (6) - 5 freq centenaries (6) - 1 freq cairies (6) - 4 freq cemeteries (6) - 2 freq arteries (6) - 5 freq batteries (6) - 8 freq caterans (6) - 5 freq fleegaries (6) - 1 freq scottories (6) - 21 freq cadgers (6) - 1 freq citris (6) - 3 freq caloris (6) - 2 freq teries (6) - 1 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 - KTKRS categories - 13 freq categorise - 1 freq caitegories - 1 freq hgducrs - 1 freq |
CATEGORIES |
| Time to execute Levenshtein function - 0.190146 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.373276 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.027526 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.037526 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.000919 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. |