Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cast-oot (0) - 1 freq call-oot (2) - 1 freq caaed-oot (3) - 1 freq daen-oot (3) - 1 freq cast-iron (3) - 1 freq cartoon (3) - 13 freq cast-aff (3) - 2 freq aathoot (3) - 1 freq wastcoat (3) - 1 freq castor (3) - 3 freq pit-oot (3) - 5 freq cop-oot (3) - 1 freq stoot (3) - 44 freq faur-oot (3) - 1 freq set-oot (3) - 5 freq airt-oot (3) - 2 freq lay-oot (3) - 2 freq carboot (3) - 3 freq bale-oot (3) - 1 freq castit (3) - 1 freq athoot (3) - 319 freq day-oot (3) - 1 freq cast-doun (3) - 1 freq laid-oot (3) - 1 freq waasht-oot (3) - 1 freq |
cast-oot (0) - 1 freq castit (4) - 1 freq set-oot (4) - 5 freq call-oot (4) - 1 freq waasht-oot (5) - 1 freq custurt (5) - 1 freq flat-oot (5) - 1 freq cast-doun (5) - 1 freq post-it (5) - 2 freq castrati (5) - 1 freq custart (5) - 4 freq costit (5) - 3 freq castigate (5) - 1 freq airt-oot (5) - 2 freq castrate (5) - 2 freq castrato (5) - 1 freq pit-oot (5) - 5 freq wastcoat (5) - 1 freq cast-iron (5) - 1 freq cop-oot (5) - 1 freq castor (5) - 3 freq least-at (5) - 3 freq stoot (5) - 44 freq cast-aff (5) - 2 freq caaed-oot (5) - 1 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 |
CAST-OOT |
Time to execute Levenshtein function - 0.207152 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.455958 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.032210 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.040036 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.000980 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. |