| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| droplet (0) - 1 freq droplets (1) - 3 freq droppit (2) - 1 freq dropped (2) - 35 freq draplets (2) - 1 freq dooblet (2) - 2 freq prophet (2) - 13 freq drappet (2) - 5 freq triplet (2) - 1 freq dropsey (2) - 1 freq droppt (2) - 1 freq hoo-let (3) - 1 freq drochles (3) - 1 freq drapper (3) - 1 freq droppis (3) - 1 freq droney (3) - 2 freq boglet (3) - 1 freq dapple (3) - 2 freq drillit (3) - 1 freq driller (3) - 5 freq crowlt (3) - 1 freq crocket (3) - 1 freq drapes (3) - 6 freq drover (3) - 1 freq rollen (3) - 2 freq |
droplet (0) - 1 freq droplets (2) - 3 freq drappet (3) - 5 freq triplet (3) - 1 freq droppt (3) - 1 freq droppit (3) - 1 freq draplets (3) - 1 freq droappt (4) - 1 freq droukelt (4) - 2 freq drippt (4) - 1 freq driplin (4) - 1 freq drappit (4) - 93 freq dreelt (4) - 1 freq drapit (4) - 1 freq draapet (4) - 1 freq replete (4) - 1 freq drappt (4) - 25 freq dreelit (4) - 1 freq drapoot (4) - 1 freq hirplet (4) - 1 freq dreeples (4) - 1 freq drapt (4) - 35 freq dropped (4) - 35 freq prophet (4) - 13 freq dooblet (4) - 2 freq |
SoundEx code - D614 dreeples - 1 freq drap-leaf - 1 freq dreeblt - 1 freq driffle - 1 freq dervil - 1 freq derval - 17 freq dearbeloved - 1 freq dreebled - 2 freq dreeble - 1 freq draplets - 1 freq druiblie - 1 freq dribblet - 1 freq drivel - 4 freq dribbles - 2 freq doorbell - 15 freq driblin - 1 freq dribblin - 5 freq dreeblin - 3 freq dreeplin - 1 freq driplin - 1 freq dry-flees - 1 freq door-bell - 1 freq droplets - 3 freq dribble - 3 freq doorbells - 1 freq drapples - 2 freq droplet - 1 freq drebble - 1 freq darvelfc - 1 freq drphiliplee - 1 freq dribbling - 1 freq dervel - 1 freq |
MetaPhone code - TRPLT triplet - 1 freq droplet - 1 freq tripled - 1 freq |
DROPLET |
| Time to execute Levenshtein function - 0.267905 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.355164 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.028067 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.039476 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.001122 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. |