| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| categories (0) - 12 freq caitegories (1) - 1 freq categorise (2) - 1 freq categorised (2) - 2 freq categoreesed (3) - 2 freq category (3) - 20 freq wateries (3) - 1 freq calories (3) - 11 freq kateforbes (3) - 2 freq stories (4) - 352 freq cemeteries (4) - 2 freq gatewies (4) - 1 freq agonies (4) - 1 freq vagaries (4) - 1 freq casenotes (4) - 1 freq memories (4) - 106 freq faeries (4) - 13 freq calvaries (4) - 1 freq caledones (4) - 1 freq catholics (4) - 8 freq caloris (4) - 2 freq caterin (4) - 4 freq calorie (4) - 1 freq naebodies (4) - 1 freq carries (4) - 10 freq |
categories (0) - 12 freq caitegories (1) - 1 freq categorise (2) - 1 freq categorised (3) - 2 freq categoreesed (4) - 2 freq category (4) - 20 freq caterers (5) - 1 freq cottaries (5) - 1 freq wateries (5) - 1 freq calories (5) - 11 freq batteries (6) - 8 freq centeries (6) - 1 freq chories (6) - 1 freq cairries (6) - 36 freq cargoes (6) - 2 freq fleegaries (6) - 1 freq factories (6) - 12 freq tories (6) - 115 freq toories (6) - 3 freq cherries (6) - 5 freq theories (6) - 3 freq coories (6) - 5 freq citris (6) - 3 freq cairies (6) - 4 freq catties (6) - 3 freq |
SoundEx code - C326 catcher - 2 freq codger - 2 freq category - 20 freq cadger - 5 freq cottagers - 2 freq cathcart - 3 freq catchwords - 1 freq categories - 12 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 - 12 freq categorise - 1 freq caitegories - 1 freq hgducrs - 1 freq |
CATEGORIES |
| Time to execute Levenshtein function - 0.195240 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.366144 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.029524 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.037827 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.000867 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. |