| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drumlie (0) - 14 freq grumlie (1) - 1 freq drumblie (1) - 1 freq frumlie (1) - 3 freq dulie (2) - 1 freq grumlin (2) - 1 freq drumkit (2) - 1 freq rumle (2) - 1 freq truelie (2) - 2 freq drumly (2) - 3 freq crummlie (2) - 1 freq drummin (2) - 9 freq brummie (2) - 1 freq drumlins (2) - 5 freq drumin (2) - 1 freq doulie (2) - 2 freq druiblie (2) - 1 freq crumlin (2) - 3 freq grumfie (2) - 1 freq drillie (2) - 1 freq rumlin (2) - 1 freq dumpie (2) - 1 freq dummie (2) - 1 freq druggie (2) - 1 freq gumlie (2) - 4 freq |
drumlie (0) - 14 freq drumly (2) - 3 freq frumlie (2) - 3 freq drumblie (2) - 1 freq grumlie (2) - 1 freq drillie (3) - 1 freq drumin (3) - 1 freq rumle (3) - 1 freq druiblie (3) - 1 freq derklie (4) - 1 freq drame (4) - 23 freq drums (4) - 36 freq drumt (4) - 1 freq grumly (4) - 1 freq drameit (4) - 1 freq dreme (4) - 5 freq dromore (4) - 1 freq drome (4) - 1 freq dramin (4) - 1 freq dremit (4) - 1 freq demmle (4) - 2 freq drumoyne (4) - 1 freq dramein (4) - 2 freq trulie (4) - 4 freq druim (4) - 1 freq |
SoundEx code - D654 drumlie - 14 freq drumly - 3 freq dream-land - 1 freq darnley - 59 freq drumlins - 5 freq drumlithie - 1 freq darnley's - 15 freq doornail - 1 freq diurnal - 1 freq dreamless - 1 freq dreamily - 1 freq dreamland - 1 freq drumlanrig - 1 freq drneilkirk - 6 freq darrenmiller - 1 freq darrenlittle - 2 freq |
MetaPhone code - TRML tremble - 6 freq tremmle - 5 freq drumlie - 14 freq drumly - 3 freq trimmle - 3 freq drumblie - 1 freq tremblay - 2 freq turmoil - 5 freq trummle - 3 freq dreamily - 1 freq terrymaley - 1 freq tramowl - 7 freq traml - 1 freq |
DRUMLIE |
| Time to execute Levenshtein function - 0.285674 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.528489 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.081262 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.093177 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.000884 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. |