| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caucusrace (0) - 1 freq caucus-race (1) - 14 freq cucuracha (4) - 1 freq accurate (4) - 9 freq accuracy (4) - 7 freq assurance (5) - 6 freq cut-price (5) - 1 freq maussacre (5) - 1 freq hauf-price (5) - 2 freq haunbrake (5) - 1 freq causays (5) - 1 freq cautrine (5) - 3 freq caurie (5) - 2 freq inaccurate (5) - 1 freq sausage (5) - 45 freq haunshake (5) - 2 freq faust-face (5) - 1 freq cause (5) - 1186 freq cap-stane (5) - 1 freq launscape (5) - 11 freq airspace (5) - 1 freq raucouse (5) - 1 freq culural (5) - 1 freq curate (5) - 7 freq circumstance (5) - 8 freq |
caucusrace (0) - 1 freq caucus-race (2) - 14 freq accuracy (5) - 7 freq accurate (6) - 9 freq cucuracha (6) - 1 freq caucasus (7) - 1 freq clausura (7) - 1 freq accuse (7) - 6 freq accusers (7) - 2 freq caesura (7) - 2 freq cochrane (7) - 4 freq conspiracy (8) - 11 freq accused (8) - 24 freq culure (8) - 1 freq capstane (8) - 1 freq scairce (8) - 1 freq dusgrace (8) - 1 freq casserole (8) - 3 freq caesar (8) - 17 freq caesarea (8) - 1 freq caur-racin (8) - 1 freq aerospace (8) - 1 freq cabrach (8) - 24 freq accause (8) - 9 freq censure (8) - 1 freq |
SoundEx code - C226 caucus-race - 14 freq caucusrace - 1 freq cock-sucker - 1 freq couch-grass - 1 freq |
MetaPhone code - KKSRS caucus-race - 14 freq caucusrace - 1 freq cxhris - 1 freq |
CAUCUSRACE |
| Time to execute Levenshtein function - 0.295019 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.512592 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.030130 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.041008 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. |