| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| custard (0) - 15 freq mustard (1) - 18 freq custart (1) - 4 freq cuboard (2) - 2 freq mustart (2) - 8 freq bastard (2) - 102 freq custurt (2) - 1 freq bussard (2) - 1 freq hussar (3) - 2 freq starm (3) - 1 freq €œmustard (3) - 1 freq cottared (3) - 5 freq cottar (3) - 28 freq cistern (3) - 5 freq caspar (3) - 1 freq mustafa (3) - 1 freq fustled (3) - 1 freq cooard (3) - 1 freq gustave (3) - 1 freq quatary (3) - 1 freq sard (3) - 3 freq busters (3) - 1 freq upstart (3) - 1 freq dusters (3) - 3 freq upward (3) - 5 freq |
custard (0) - 15 freq mustard (2) - 18 freq custart (2) - 4 freq custurt (3) - 1 freq bastard (3) - 102 freq courtyard (4) - 5 freq casters (4) - 2 freq castor (4) - 3 freq cultured (4) - 3 freq castled (4) - 1 freq casted (4) - 2 freq stared (4) - 69 freq custody (4) - 13 freq clustered (4) - 1 freq craturd (4) - 1 freq basturd (4) - 2 freq mustered (4) - 1 freq wastird (4) - 4 freq caster (4) - 2 freq cottared (4) - 5 freq bussard (4) - 1 freq mustart (4) - 8 freq cuboard (4) - 2 freq cistern (4) - 5 freq custrin (4) - 1 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 - KSTRT custart - 4 freq castrate - 2 freq custard - 15 freq custurt - 1 freq castrati - 1 freq castrato - 1 freq |
CUSTARD |
| Time to execute Levenshtein function - 0.238292 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.417994 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.032649 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.039017 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.000813 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. |