| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| driblin (0) - 1 freq driplin (1) - 1 freq dribblin (1) - 5 freq drillin (1) - 13 freq dreeblin (2) - 3 freq dublin (2) - 29 freq draalin (2) - 2 freq dirlin (2) - 45 freq rivlin (2) - 5 freq drinkin (2) - 127 freq droolin (2) - 3 freq dreelin (2) - 1 freq dribbling (2) - 1 freq dibblin (2) - 1 freq cribbin (2) - 1 freq dailin (2) - 1 freq drillie (2) - 1 freq riflin (2) - 1 freq raiblin (2) - 1 freq driyin (2) - 1 freq druiblie (2) - 1 freq dreillin (2) - 1 freq dripin (2) - 1 freq grillin (2) - 1 freq driftin (2) - 23 freq |
driblin (0) - 1 freq dreeblin (2) - 3 freq drillin (2) - 13 freq driplin (2) - 1 freq dribblin (2) - 5 freq doublin (3) - 6 freq truiblin (3) - 1 freq raiblin (3) - 1 freq drawlin (3) - 7 freq dibblin (3) - 1 freq dreillin (3) - 1 freq druiblie (3) - 1 freq dreelin (3) - 1 freq dirlin (3) - 45 freq draalin (3) - 2 freq dublin (3) - 29 freq dwaiblin (3) - 1 freq draiglin (3) - 1 freq droolin (3) - 3 freq dreeplin (4) - 1 freq warblin (4) - 1 freq ribbin (4) - 2 freq derlin (4) - 1 freq trimlin (4) - 1 freq darklin (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 doorbell - 15 freq drivel - 3 freq driblin - 1 freq dribblin - 5 freq dreeblin - 3 freq dreeplin - 1 freq dribbles - 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 |
DRIBLIN |
| Time to execute Levenshtein function - 0.226830 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.369947 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.031797 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.046170 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.000908 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. |