| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| succumbs (0) - 1 freq succumb (1) - 1 freq succubus (2) - 1 freq succumbed (2) - 3 freq sumtums (3) - 2 freq succeeds (3) - 1 freq sclumb (3) - 1 freq crumbs (3) - 44 freq scrumps (3) - 1 freq success (3) - 97 freq scrums (3) - 1 freq suburbs (3) - 8 freq scrubs (3) - 6 freq sclimbs (3) - 1 freq scaums (3) - 1 freq succudrus (3) - 1 freq fuscus (4) - 2 freq cumes (4) - 1 freq vaccum (4) - 1 freq scabs (4) - 7 freq scouts (4) - 3 freq scrub (4) - 19 freq succulent (4) - 1 freq sacrum (4) - 1 freq scules (4) - 1 freq |
succumbs (0) - 1 freq succumb (2) - 1 freq succumbed (3) - 3 freq succubus (3) - 1 freq sclimbs (4) - 1 freq scrums (5) - 1 freq success (5) - 97 freq succudrus (5) - 1 freq scaums (5) - 1 freq scrubs (5) - 6 freq succeeds (5) - 1 freq scrumps (5) - 1 freq crumbs (5) - 44 freq sclumb (5) - 1 freq combs (6) - 7 freq sclimb (6) - 1 freq sclims (6) - 10 freq successes (6) - 6 freq schames (6) - 2 freq sclimbt (6) - 1 freq stumbas (6) - 2 freq climbs (6) - 2 freq scumbag (6) - 2 freq schemes (6) - 42 freq scams (6) - 1 freq |
SoundEx code - S251 significant - 35 freq signeeficant - 2 freq signpostin - 7 freq signify - 5 freq significance - 16 freq sea-campion - 1 freq succumbed - 3 freq signboard - 3 freq signifies - 2 freq signeificance - 4 freq succumbs - 1 freq signboord - 1 freq succumb - 1 freq sacnfeeces - 1 freq signifees - 1 freq 'significant' - 1 freq signifeein - 1 freq sign-brods - 2 freq signbrods - 1 freq signpostit - 1 freq seignificant - 1 freq significatione - 1 freq signeificant - 2 freq seignifies - 1 freq sygnefyinge - 1 freq signifeed - 1 freq signeeficance - 1 freq seegnify - 1 freq sign-ups - 1 freq signifiecant - 1 freq signposts - 2 freq significantly - 7 freq sign-buirds - 1 freq sign-aff - 1 freq |
MetaPhone code - SKKMS succumbs - 1 freq |
SUCCUMBS |
| Time to execute Levenshtein function - 0.403800 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.780554 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.034307 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.100826 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.001131 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. |