| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coaster (0) - 18 freq coasted (1) - 1 freq caster (1) - 2 freq coster (1) - 1 freq toaster (1) - 6 freq coasters (1) - 4 freq roaster (1) - 17 freq blaster (2) - 3 freq houster (2) - 1 freq chaste (2) - 1 freq folster (2) - 1 freq 'easter (2) - 1 freq boasted (2) - 1 freq booster (2) - 3 freq cooser (2) - 3 freq coonter (2) - 70 freq hoasted (2) - 7 freq coastal (2) - 11 freq doacter (2) - 5 freq counter (2) - 19 freq casper (2) - 1 freq rooster (2) - 18 freq lobster (2) - 23 freq posster (2) - 1 freq bolster (2) - 4 freq |
coaster (0) - 18 freq caster (1) - 2 freq coster (1) - 1 freq coasted (2) - 1 freq castor (2) - 3 freq roaster (2) - 17 freq coasters (2) - 4 freq toaster (2) - 6 freq castel (3) - 8 freq conter (3) - 47 freq coast (3) - 115 freq pooster (3) - 5 freq coulter (3) - 6 freq faaster (3) - 6 freq coste (3) - 1 freq clister (3) - 1 freq craiter (3) - 27 freq oxster (3) - 4 freq poster (3) - 23 freq moister (3) - 7 freq diaster (3) - 1 freq waster (3) - 13 freq canter (3) - 3 freq casters (3) - 2 freq foster (3) - 19 freq |
SoundEx code - C236 custart - 4 freq cistercian - 1 freq coasters - 4 freq coaster - 18 freq castrate - 2 freq custard - 15 freq chak-strenthened - 1 freq casters - 2 freq castor-oil - 1 freq cast-iron - 1 freq castration - 1 freq custurt - 1 freq 'castor - 1 freq cheuchter - 1 freq 'castor' - 1 freq coquetry - 1 freq cistern - 5 freq castrated - 1 freq castor - 3 freq caster - 2 freq chester - 1 freq chustdoowaer - 1 freq cash-tray - 1 freq custrin - 1 freq castrati - 1 freq castrato - 1 freq chesthairs - 1 freq coster - 1 freq chesters - 4 freq |
MetaPhone code - KSTR coaster - 18 freq gowster - 2 freq gowsterie - 1 freq gouster - 5 freq 'castor - 1 freq 'castor' - 1 freq castor - 3 freq caster - 2 freq gousterie - 1 freq coster - 1 freq gazetteer - 1 freq gowsteri - 1 freq |
COASTER |
| Time to execute Levenshtein function - 0.172681 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.351606 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.028403 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.036960 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.000826 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. |