| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| developed (0) - 32 freq develoved (1) - 1 freq developer (1) - 3 freq enveloped (2) - 1 freq developt (2) - 3 freq developit (2) - 7 freq developers (2) - 2 freq developin (2) - 35 freq develops (2) - 4 freq develop (2) - 44 freq devoored (3) - 1 freq levelled (3) - 4 freq devoted (3) - 4 freq invelope (3) - 6 freq develue (3) - 1 freq developers' (3) - 1 freq penelope (3) - 7 freq dolloped (3) - 1 freq deployed (3) - 2 freq envelopes (3) - 6 freq devored (3) - 1 freq devalled (3) - 1 freq devolved (3) - 7 freq devalued (3) - 2 freq developing (3) - 7 freq |
developed (0) - 32 freq developer (2) - 3 freq develoved (2) - 1 freq develops (3) - 4 freq developin (3) - 35 freq develop (3) - 44 freq enveloped (3) - 1 freq developt (3) - 3 freq developit (3) - 7 freq dolloped (4) - 1 freq devalved (4) - 1 freq devalued (4) - 2 freq devolved (4) - 7 freq developers (4) - 2 freq devalled (4) - 1 freq developing (5) - 7 freq divulged (5) - 3 freq devauled (5) - 13 freq deplored (5) - 1 freq 'develop (5) - 2 freq envelope (5) - 71 freq invelope (5) - 6 freq devored (5) - 1 freq levelled (5) - 4 freq devoored (5) - 1 freq |
SoundEx code - D141 developments - 18 freq develop - 44 freq developin - 35 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 - TFLPT developed - 32 freq developit - 7 freq developt - 3 freq |
DEVELOPED |
| Time to execute Levenshtein function - 0.199611 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.381432 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.027649 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.036683 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.000841 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. |