| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coasters (0) - 4 freq casters (1) - 2 freq coaster (1) - 18 freq roasters (1) - 8 freq monsters (2) - 15 freq chanters (2) - 9 freq pousters (2) - 1 freq craiters (2) - 19 freq chesters (2) - 4 freq canters (2) - 1 freq masters (2) - 10 freq coasts (2) - 4 freq castels (2) - 2 freq possters (2) - 1 freq coonters (2) - 1 freq corters (2) - 1 freq clatters (2) - 8 freq bowsters (2) - 2 freq wasters (2) - 6 freq roaster (2) - 17 freq coulters (2) - 1 freq oxsters (2) - 8 freq oysters (2) - 2 freq clusters (2) - 5 freq toaster (2) - 6 freq |
coasters (0) - 4 freq casters (1) - 2 freq roasters (2) - 8 freq coaster (2) - 18 freq tasters (3) - 1 freq conters (3) - 1 freq clusters (3) - 5 freq coulters (3) - 1 freq coosers (3) - 1 freq oxsters (3) - 8 freq oysters (3) - 2 freq coster (3) - 1 freq craters (3) - 24 freq posters (3) - 30 freq gousters (3) - 3 freq wasters (3) - 6 freq roosters (3) - 3 freq caster (3) - 2 freq craeters (3) - 1 freq masters (3) - 10 freq coasts (3) - 4 freq canters (3) - 1 freq chesters (3) - 4 freq pousters (3) - 1 freq castels (3) - 2 freq |
SoundEx code - C236 custart - 4 freq cistercian - 1 freq coasters - 4 freq coaster - 18 freq castrate - 2 freq custard - 15 freq cistern - 6 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 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 - KSTRS gastrous - 3 freq coasters - 4 freq gowsterous - 3 freq casters - 2 freq quaestorius - 1 freq gousters - 3 freq gowsters - 1 freq gowstrous - 1 freq |
COASTERS |
| Time to execute Levenshtein function - 0.291610 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.485111 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.031614 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.039658 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.000949 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. |