| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| codger (0) - 2 freq cadger (1) - 5 freq codgers (1) - 1 freq rodger (1) - 4 freq dodger (1) - 5 freq sodger (1) - 114 freq lodger (1) - 3 freq codgie (2) - 2 freq jogger (2) - 1 freq copper (2) - 22 freq hodged (2) - 3 freq dogger (2) - 1 freq gadger (2) - 1 freq cover (2) - 147 freq cobler (2) - 1 freq roger (2) - 5 freq logger (2) - 1 freq fodder (2) - 9 freq lodgers (2) - 4 freq cadge (2) - 2 freq moger (2) - 1 freq couler (2) - 1 freq commer (2) - 1 freq dodge (2) - 12 freq codes (2) - 4 freq |
codger (0) - 2 freq cadger (1) - 5 freq lodger (2) - 3 freq cadgier (2) - 1 freq sodger (2) - 114 freq rodger (2) - 4 freq dodger (2) - 5 freq codgers (2) - 1 freq ludger (3) - 4 freq counger (3) - 1 freq cadge (3) - 2 freq cider (3) - 38 freq cougar (3) - 1 freq tadger (3) - 3 freq wadger (3) - 5 freq ledger (3) - 1 freq cudgel (3) - 1 freq codgie (3) - 2 freq cadged (3) - 1 freq cadgers (3) - 1 freq badger (3) - 6 freq gadger (3) - 1 freq coster (4) - 1 freq concer (4) - 1 freq cooker (4) - 21 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 - KJR codger - 2 freq cadger - 5 freq gadger - 1 freq cadgier - 1 freq gjr - 1 freq |
CODGER |
| Time to execute Levenshtein function - 0.208402 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.362561 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.029853 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.038594 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.001161 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. |