| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chuckles (0) - 1 freq huckles (1) - 1 freq chuckle (1) - 11 freq chuckled (1) - 12 freq chuckies (1) - 25 freq puckles (2) - 14 freq cackles (2) - 1 freq kuckles (2) - 1 freq shackles (2) - 6 freq hackles (2) - 3 freq buckles (2) - 1 freq ruckles (2) - 1 freq chukkies (2) - 2 freq crunkles (2) - 1 freq chuckens (2) - 5 freq chucken (2) - 17 freq chuckneys (2) - 2 freq huckle (2) - 11 freq knuckles (2) - 29 freq chuckers (2) - 1 freq chickle (2) - 1 freq crackles (2) - 2 freq chucket (2) - 3 freq chuckie (2) - 10 freq chuckie's (2) - 1 freq |
chuckles (0) - 1 freq chuckled (2) - 12 freq chuckies (2) - 25 freq chuckle (2) - 11 freq huckles (2) - 1 freq chucklin (3) - 3 freq chuckneys (3) - 2 freq chuckers (3) - 1 freq chucknies (3) - 1 freq cockles (3) - 6 freq chucks (3) - 4 freq chuckie's (3) - 1 freq chucklan (3) - 1 freq crackles (3) - 2 freq chickle (3) - 1 freq coackles (3) - 1 freq shackles (3) - 6 freq cackles (3) - 1 freq chuckens (3) - 5 freq hackles (3) - 3 freq chucked (4) - 28 freq chickens (4) - 30 freq chicks (4) - 8 freq huckled (4) - 12 freq muckles (4) - 1 freq |
SoundEx code - C242 cycles - 5 freq casual-like - 2 freq cockaleekie - 1 freq cockles - 6 freq cheisels - 1 freq cyclist - 5 freq cashielaas - 2 freq cosy-like - 2 freq cockieleekie - 1 freq coagles - 1 freq cosh-lyke - 1 freq coackles - 1 freq cyclists - 12 freq cackles - 1 freq chuckles - 1 freq cyclically - 1 freq cugallach - 1 freq cyclical - 1 freq cyclescotland - 1 freq |
MetaPhone code - XKLS shoogles - 7 freq shackles - 6 freq shuggles - 1 freq shiggles - 1 freq chuckles - 1 freq |
CHUCKLES |
| Time to execute Levenshtein function - 0.183193 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.373702 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.028313 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.041431 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.000862 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. |