| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreeplin (0) - 1 freq dreelin (1) - 1 freq dreedlin (1) - 1 freq dreezlin (1) - 1 freq dreeblin (1) - 3 freq dreepin (1) - 66 freq dreeples (2) - 1 freq reelin (2) - 16 freq dreippin (2) - 1 freq treetlin (2) - 5 freq dreipin (2) - 4 freq driplin (2) - 1 freq dreeping (2) - 1 freq dreillin (2) - 1 freq dreein (2) - 1 freq wheeplin (2) - 8 freq dreelit (2) - 1 freq creelin (2) - 2 freq seeplin (2) - 1 freq dreepit (2) - 7 freq deeplie (2) - 1 freq sleeplin (2) - 1 freq feeplin (2) - 1 freq creepin (2) - 49 freq deelin (2) - 1 freq |
dreeplin (0) - 1 freq driplin (2) - 1 freq dreeblin (2) - 3 freq dreepin (2) - 66 freq dreelin (2) - 1 freq dreezlin (2) - 1 freq dreedlin (2) - 1 freq dreipin (3) - 4 freq dreeples (3) - 1 freq dreillin (3) - 1 freq dreippin (3) - 1 freq droappin (4) - 8 freq drawlin (4) - 7 freq drippin (4) - 23 freq drapin (4) - 1 freq derlin (4) - 1 freq drooklin (4) - 1 freq derklin (4) - 1 freq adrenalin (4) - 4 freq drappin (4) - 68 freq dumplin (4) - 25 freq droppin (4) - 8 freq drillin (4) - 13 freq dripin (4) - 1 freq deciplin (4) - 1 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 - TRPLN taarpaalin - 1 freq dreeplin - 1 freq driplin - 1 freq |
DREEPLIN |
| Time to execute Levenshtein function - 0.221842 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.346977 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.029863 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.037636 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.000938 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. |