| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| develop (0) - 44 freq develops (1) - 4 freq 'develop (1) - 2 freq developt (1) - 3 freq developer (2) - 3 freq deveron (2) - 1 freq developed (2) - 32 freq developit (2) - 7 freq develue (2) - 1 freq developes (2) - 1 freq developin (2) - 36 freq envelops (3) - 1 freq develoved (3) - 1 freq levellt (3) - 1 freq deval (3) - 4 freq levelt (3) - 1 freq devon (3) - 4 freq revell (3) - 1 freq dollop (3) - 3 freq developers (3) - 2 freq devillok (3) - 1 freq beelo (3) - 1 freq deel (3) - 2 freq develing (3) - 1 freq desel (3) - 4 freq |
develop (0) - 44 freq 'develop (2) - 2 freq developt (2) - 3 freq develops (2) - 4 freq developes (3) - 1 freq developin (3) - 36 freq developit (3) - 7 freq develue (3) - 1 freq developer (3) - 3 freq developed (3) - 32 freq envelope (4) - 72 freq invelope (4) - 6 freq devalna (4) - 1 freq devlin (4) - 1 freq devil (4) - 35 freq devals (4) - 1 freq dollop (4) - 3 freq dunlop (4) - 21 freq devilry (4) - 2 freq deveron (4) - 1 freq deval (4) - 4 freq devils (4) - 1 freq divilry (5) - 1 freq dunlap (5) - 2 freq dilip (5) - 1 freq |
SoundEx code - D141 developments - 18 freq develop - 44 freq developin - 36 freq developes - 1 freq develops - 4 freq developed - 32 freq developer - 3 freq developers - 2 freq developers' - 1 freq development - 76 freq development' - 2 freq developit - 7 freq developt - 3 freq devalved - 1 freq double-bills - 1 freq developing - 7 freq 'develop - 2 freq developmints - 1 freq dooble-up - 1 freq double-breasted - 1 freq devolved - 7 freq dooble-bed - 1 freq developmets - 1 freq double-parked - 1 freq double-barrel - 1 freq develoved - 1 freq devolvin - 2 freq deevelopmint - 1 freq dubalba - 1 freq devolvit - 1 freq |
MetaPhone code - TFLP develop - 44 freq 'develop - 2 freq |
DEVELOP |
| Time to execute Levenshtein function - 0.200298 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.364493 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.028063 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.038100 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.000864 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. |