| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chocolates (0) - 15 freq chocolate (1) - 226 freq chocolatey (1) - 1 freq chocolate's (1) - 1 freq chocolatiers (2) - 1 freq chocolat (2) - 1 freq chocolately (2) - 1 freq shocolate (2) - 2 freq 'chocolate' (2) - 1 freq choklate (3) - 1 freq choacalate (3) - 1 freq chookies (4) - 19 freq consates (4) - 2 freq cochranes (4) - 1 freq coogate (4) - 2 freq conflate (4) - 1 freq chocolonely (4) - 1 freq molocates (4) - 2 freq crosflats (4) - 1 freq hoolits (4) - 1 freq circulate (4) - 3 freq hochles (4) - 1 freq cockles (4) - 6 freq accolades (4) - 1 freq collated (4) - 1 freq |
chocolates (0) - 15 freq chocolatey (2) - 1 freq chocolate's (2) - 1 freq chocolate (2) - 226 freq chocolately (3) - 1 freq chocolat (3) - 1 freq chocolatiers (3) - 1 freq choacalate (4) - 1 freq 'chocolate' (4) - 1 freq shocolate (4) - 2 freq choklate (5) - 1 freq accolytes (5) - 1 freq hoolets (6) - 5 freq charolais (6) - 1 freq consulates (6) - 1 freq escalates (6) - 1 freq acolytes (6) - 1 freq coconuts (6) - 2 freq calculated (6) - 1 freq hoplites (6) - 1 freq checkoots (6) - 1 freq chates (6) - 1 freq chuckles (6) - 1 freq nicolytes (6) - 1 freq sclates (6) - 14 freq |
SoundEx code - C243 chuckled - 12 freq chocolate - 226 freq chocolatey - 1 freq casualty - 13 freq cockled - 2 freq coogled - 1 freq casualties - 5 freq chocolate-box - 1 freq chocolates - 15 freq chocolately - 1 freq chocolate-makkin - 1 freq chocolate-coatit - 3 freq chocolate-mixin - 2 freq chocolate's - 1 freq cycled - 3 freq chocolatiers - 1 freq 'chocolate' - 1 freq cackled - 2 freq cackelt - 1 freq chiselled - 2 freq chocolat - 1 freq choklate - 1 freq coagulate - 1 freq cockslut - 2 freq cooclayton - 1 freq choacalate - 1 freq |
MetaPhone code - XKLTS chocolates - 15 freq chocolate's - 1 freq |
CHOCOLATES |
| Time to execute Levenshtein function - 0.208342 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.366649 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.027411 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.037370 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.000895 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. |