Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
coasted (0) - 1 freq coated (1) - 4 freq boasted (1) - 1 freq roasted (1) - 5 freq toasted (1) - 3 freq coaster (1) - 18 freq casted (1) - 2 freq hoasted (1) - 7 freq coste (2) - 1 freq blasted (2) - 7 freq lasted (2) - 16 freq rowsted (2) - 6 freq clarted (2) - 14 freq crashed (2) - 28 freq ceased (2) - 7 freq clased (2) - 2 freq roaster (2) - 17 freq carted (2) - 2 freq coasters (2) - 4 freq tasted (2) - 20 freq counted (2) - 13 freq caased (2) - 6 freq pasted (2) - 2 freq chased (2) - 50 freq wasted (2) - 24 freq |
coasted (0) - 1 freq casted (1) - 2 freq hoasted (2) - 7 freq coaster (2) - 18 freq coated (2) - 4 freq toasted (2) - 3 freq boasted (2) - 1 freq roasted (2) - 5 freq coasta (3) - 1 freq caster (3) - 2 freq casten (3) - 2 freq posted (3) - 21 freq caste (3) - 2 freq boosted (3) - 1 freq feasted (3) - 2 freq crested (3) - 2 freq coastin (3) - 1 freq coster (3) - 1 freq coasts (3) - 4 freq coorted (3) - 2 freq castled (3) - 1 freq rousted (3) - 2 freq coonted (3) - 16 freq hasted (3) - 2 freq roosted (3) - 2 freq |
SoundEx code - C233 custody - 13 freq costit - 3 freq coasted - 1 freq 'cock-a-doodle-do - 1 freq castit - 1 freq cock-a-doodle-doo - 1 freq cockadoodle - 1 freq custodians - 3 freq chistit - 2 freq chestitie - 1 freq custodian - 3 freq casted - 2 freq cascaded - 1 freq custodianship - 1 freq cast-oot - 1 freq |
MetaPhone code - KSTT custody - 13 freq costit - 3 freq kistit' - 1 freq kistit - 7 freq coasted - 1 freq castit - 1 freq kisted - 1 freq casted - 2 freq cast-oot - 1 freq wkstott - 1 freq |
COASTED |
Time to execute Levenshtein function - 0.258440 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.573130 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.028208 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.072887 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.000885 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. |