| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| divided (0) - 12 freq divide (1) - 24 freq dividend (1) - 1 freq divides (1) - 4 freq dividen (1) - 1 freq divider (1) - 1 freq divyded (1) - 1 freq devined (2) - 1 freq decided (2) - 210 freq divid (2) - 10 freq devised (2) - 1 freq dividin (2) - 4 freq dived (2) - 21 freq devide (2) - 1 freq dividit (2) - 7 freq divines (2) - 1 freq dirded (2) - 1 freq dreided (2) - 4 freq dividends (2) - 1 freq divvied (2) - 2 freq dividan (2) - 1 freq divine (2) - 29 freq heided (3) - 35 freq davidbu (3) - 1 freq dined (3) - 6 freq |
divided (0) - 12 freq divyded (1) - 1 freq dividen (2) - 1 freq divider (2) - 1 freq divides (2) - 4 freq dividend (2) - 1 freq divide (2) - 24 freq dirded (3) - 1 freq dreided (3) - 4 freq dividan (3) - 1 freq dividit (3) - 7 freq divvied (3) - 2 freq devide (3) - 1 freq divid (3) - 10 freq decided (3) - 210 freq devised (3) - 1 freq devined (3) - 1 freq dividin (3) - 4 freq dived (3) - 21 freq deived (4) - 1 freq davidm (4) - 2 freq david (4) - 234 freq dreeded (4) - 2 freq dadded (4) - 1 freq dovered (4) - 6 freq |
SoundEx code - D133 divided - 12 freq dividit - 7 freq defeated - 7 freq doubted - 7 freq defeatit - 5 freq debated - 3 freq devoted - 4 freq dabbity-dab - 4 freq debatit - 9 freq divyded - 1 freq deptht - 4 freq dievydit - 1 freq devotit - 5 freq 'dividit - 1 freq devotedly - 1 freq doobted - 1 freq deviatit - 2 freq defaitit - 1 freq davidhdickson - 1 freq davidhtorrance - 1 freq |
MetaPhone code - TFTT divided - 12 freq dividit - 7 freq defeated - 7 freq defeatit - 5 freq devoted - 4 freq divyded - 1 freq tufted - 1 freq dievydit - 1 freq devotit - 5 freq 'dividit - 1 freq deviatit - 2 freq defaitit - 1 freq dightit - 1 freq |
DIVIDED |
| Time to execute Levenshtein function - 0.190979 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.431740 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.030264 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.045871 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.000930 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. |