| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| susbtrate (0) - 1 freq substrate (2) - 2 freq frustrate (3) - 2 freq strate (3) - 1 freq castrate (3) - 2 freq substrata (3) - 1 freq subtract (3) - 1 freq castrati (4) - 1 freq bustage (4) - 1 freq suitcase (4) - 14 freq futrats (4) - 1 freq curate (4) - 7 freq sumatra (4) - 1 freq stryte (4) - 2 freq futrat (4) - 10 freq subtle (4) - 27 freq sustain (4) - 5 freq strath (4) - 12 freq lustre (4) - 3 freq separate (4) - 49 freq penetrate (4) - 6 freq vibrate (4) - 5 freq subtlety (4) - 4 freq dusgrace (4) - 1 freq sperate (4) - 1 freq |
susbtrate (0) - 1 freq substrate (4) - 2 freq subtract (5) - 1 freq castrate (5) - 2 freq substrata (5) - 1 freq strate (5) - 1 freq castrato (6) - 1 freq strete (6) - 4 freq subtext (6) - 1 freq strite (6) - 1 freq subtlety (6) - 4 freq strata (6) - 4 freq stryte (6) - 2 freq castrati (6) - 1 freq frustrate (6) - 2 freq nitrate (7) - 1 freq strade (7) - 11 freq state (7) - 368 freq sunburnt (7) - 3 freq desperate (7) - 94 freq sublimate (7) - 1 freq straue (7) - 1 freq stret (7) - 1 freq aspirate (7) - 1 freq berate (7) - 1 freq |
SoundEx code - S213 saggy-bawed - 1 freq six-fit - 2 freq sauch-patternt - 1 freq six-fit-four - 3 freq six-foot - 1 freq seeck-beds - 1 freq six-feet - 1 freq shoogie-boats - 1 freq suackbuts - 1 freq seik-bed - 1 freq sax-fit - 1 freq suspetioun - 1 freq suspeitioun - 1 freq susbtrate - 1 freq susceptible - 3 freq sesspit - 1 freq |
MetaPhone code - SSBTRT susbtrate - 1 freq |
SUSBTRATE |
| Time to execute Levenshtein function - 0.224362 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.407872 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.029002 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.039230 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.000885 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. |