| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| custody (0) - 13 freq customs (2) - 15 freq custom (2) - 13 freq busted (3) - 5 freq usty (3) - 1 freq cutey (3) - 1 freq stooy (3) - 1 freq cursory (3) - 5 freq untidy (3) - 1 freq customer (3) - 29 freq rustly (3) - 1 freq custodian (3) - 3 freq crusty (3) - 5 freq cassidy (3) - 4 freq dusty (3) - 17 freq cody (3) - 1 freq custard (3) - 15 freq casted (3) - 2 freq ctodd (3) - 1 freq sumbody (3) - 6 freq curtsy (3) - 1 freq story (3) - 697 freq cuntry (3) - 2 freq study (3) - 114 freq muscovy (3) - 1 freq |
custody (0) - 13 freq casted (3) - 2 freq custom (3) - 13 freq study (4) - 114 freq rusted (4) - 5 freq custard (4) - 15 freq castor (4) - 3 freq dusted (4) - 6 freq coasted (4) - 1 freq costo (4) - 1 freq cassidy (4) - 4 freq crusted (4) - 3 freq costly (4) - 4 freq customs (4) - 15 freq custodian (4) - 3 freq busted (4) - 5 freq castle (5) - 153 freq cited (5) - 3 freq castit (5) - 1 freq costume (5) - 9 freq cist (5) - 1 freq cscd (5) - 1 freq curated (5) - 1 freq steidy (5) - 11 freq listed (5) - 6 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 coasted - 1 freq castit - 1 freq kisted - 1 freq kistit - 6 freq casted - 2 freq cast-oot - 1 freq wkstott - 1 freq |
CUSTODY |
| Time to execute Levenshtein function - 0.302310 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.562759 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.027333 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.043023 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.000814 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. |