| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cut-price (0) - 1 freq hauf-price (3) - 2 freq cutie (4) - 4 freq lexiprice (4) - 1 freq motrice (4) - 1 freq guthrie (4) - 6 freq katieprice (4) - 1 freq comprise (4) - 1 freq gutterie (4) - 1 freq cattrick (4) - 1 freq cuttie (4) - 30 freq culprit (4) - 4 freq hat-trick (4) - 2 freq authorite (4) - 1 freq cult-like (4) - 1 freq citric (4) - 2 freq thrice (4) - 9 freq luthrie (4) - 1 freq cuppie (4) - 27 freq cat-like (4) - 1 freq cuttance (4) - 7 freq surprise (4) - 210 freq cautrine (4) - 3 freq dub-pie (4) - 1 freq trice (4) - 1 freq |
cut-price (0) - 1 freq hauf-price (5) - 2 freq citric (6) - 2 freq katieprice (6) - 1 freq cautrine (7) - 3 freq trice (7) - 1 freq thrice (7) - 9 freq cat-like (7) - 1 freq cuttance (7) - 7 freq cuppic (7) - 1 freq hoose-price (7) - 1 freq car-pairk (7) - 3 freq centerprece (7) - 1 freq price (7) - 179 freq nit-trie (7) - 2 freq catherine (7) - 12 freq culprit (7) - 4 freq motrice (7) - 1 freq cattrick (7) - 1 freq lexiprice (7) - 1 freq comprise (7) - 1 freq hat-trick (7) - 2 freq sey-piece (8) - 1 freq nit-tries (8) - 1 freq commerce (8) - 4 freq |
SoundEx code - C316 cuthberti - 1 freq cadbury's - 3 freq cadavers - 2 freq cut-price - 1 freq cyathiform - 1 freq cuthbert's - 1 freq cadaver - 1 freq coatbridge - 1 freq cadeverous - 1 freq cadbury - 3 freq coatbrig - 1 freq cadburys - 2 freq |
MetaPhone code - KTPRS cut-price - 1 freq katieprice - 1 freq |
CUT-PRICE |
| Time to execute Levenshtein function - 0.237406 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.362096 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.027796 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.037777 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.000854 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. |