| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dribblin (0) - 5 freq driblin (1) - 1 freq tribblin (1) - 1 freq dribbling (1) - 1 freq dibblin (1) - 1 freq cribbin (2) - 1 freq dribbles (2) - 2 freq dreeblin (2) - 3 freq drittlin (2) - 2 freq ribbin (2) - 2 freq driplin (2) - 1 freq scribblin (2) - 8 freq grabblin (2) - 1 freq drillin (2) - 13 freq jibblin (2) - 1 freq nibblin (2) - 7 freq bibblin (2) - 2 freq dribble (2) - 3 freq dribblet (2) - 1 freq birblin (3) - 1 freq ripplin (3) - 12 freq grumblin (3) - 1 freq drillit (3) - 1 freq dwinnlin (3) - 2 freq dreezlin (3) - 1 freq |
dribblin (0) - 5 freq driblin (2) - 1 freq dribbling (2) - 1 freq dibblin (2) - 1 freq tribblin (2) - 1 freq dribblet (3) - 1 freq grabblin (3) - 1 freq dribble (3) - 3 freq dreeblin (3) - 3 freq dribbles (3) - 2 freq bibblin (4) - 2 freq drebble (4) - 1 freq serabblin (4) - 1 freq jibblin (4) - 1 freq nibblin (4) - 7 freq cribbin (4) - 1 freq drittlin (4) - 2 freq driplin (4) - 1 freq ribbin (4) - 2 freq drillin (4) - 13 freq scribblin (4) - 8 freq ribban (5) - 1 freq drooklin (5) - 1 freq droolin (5) - 3 freq dabbin (5) - 8 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 - TRBLN truiblin - 1 freq troublin - 1 freq driblin - 1 freq dribblin - 5 freq dreeblin - 3 freq tribillin - 1 freq tribblin - 1 freq |
DRIBBLIN |
| Time to execute Levenshtein function - 0.177071 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.347260 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.027631 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.036845 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.000915 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. |