Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
scarlet (0) - 22 freq scairlet (1) - 1 freq scarlett (1) - 1 freq scaldet (2) - 1 freq snarlit (2) - 1 freq scarier (2) - 1 freq scartit (2) - 23 freq sallet (2) - 1 freq scayle (2) - 1 freq startlet (2) - 5 freq snarled (2) - 13 freq scarey (2) - 2 freq scarper (2) - 2 freq scale't (2) - 1 freq scordet (2) - 1 freq sharet (2) - 3 freq scailit (2) - 2 freq soartet (2) - 1 freq scares (2) - 5 freq sparet (2) - 1 freq startet (2) - 150 freq snarlt (2) - 1 freq carret (2) - 3 freq starlit (2) - 1 freq scariest (2) - 1 freq |
scarlet (0) - 22 freq scairlet (1) - 1 freq scarlett (2) - 1 freq snarlt (3) - 1 freq scart (3) - 23 freq scordet (3) - 1 freq scailit (3) - 2 freq starlit (3) - 1 freq scariest (3) - 1 freq snarlit (3) - 1 freq scartit (3) - 23 freq iscariot (4) - 5 freq smirlt (4) - 1 freq swirlt (4) - 2 freq scort (4) - 1 freq secret (4) - 198 freq scirt (4) - 1 freq scrit (4) - 6 freq scartled (4) - 1 freq scoult (4) - 3 freq scaurt (4) - 2 freq scraipet (4) - 2 freq scraaled (4) - 1 freq scrat (4) - 31 freq skirlt (4) - 1 freq |
SoundEx code - S643 scarlet - 22 freq skirled - 101 freq scairlet - 1 freq skirlt - 1 freq swirled - 3 freq scrawled - 4 freq swirlt - 2 freq shareholders - 2 freq skirlit - 1 freq scrolled - 2 freq shareholders' - 1 freq scarlett - 1 freq scarlet-heavy - 1 freq squirrelt - 1 freq scraaled - 1 freq surrealtimescot - 1 freq surrealthing - 1 freq shireldp - 1 freq |
MetaPhone code - SKRLT scarlet - 22 freq skirled - 101 freq scairlet - 1 freq skirlt - 1 freq scrawled - 4 freq skirlit - 1 freq scrolled - 2 freq scarlett - 1 freq squirrelt - 1 freq scraaled - 1 freq |
SCARLET |
Time to execute Levenshtein function - 0.212047 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.378338 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.027507 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.039621 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.001060 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. |