| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| darrenmiller (0) - 1 freq darrentucker (4) - 10 freq darrenlittle (4) - 2 freq warrender (5) - 1 freq barrelled (5) - 3 freq daimen-icker (5) - 1 freq marseilles (5) - 1 freq barrmill (5) - 2 freq darrensamuel (5) - 2 freq driller (5) - 5 freq darrengrimes (5) - 2 freq darrenmurray (5) - 6 freq painkiller (5) - 1 freq weedkiller (6) - 1 freq dreicher (6) - 1 freq karendallas (6) - 1 freq dancefleer (6) - 1 freq dasheill (6) - 1 freq wattermill (6) - 1 freq chenille (6) - 1 freq dalmenie (6) - 5 freq warrandice (6) - 2 freq carrier (6) - 15 freq rentier (6) - 1 freq arreinge (6) - 1 freq |
darrenmiller (0) - 1 freq darrenmurray (7) - 6 freq darrentucker (7) - 10 freq driller (8) - 5 freq darrenlittle (8) - 2 freq darrensamuel (8) - 2 freq barrmill (8) - 2 freq craigmillar (9) - 1 freq derrenm (9) - 1 freq barriehamill (9) - 1 freq rhodamiller (9) - 7 freq coarnmill (9) - 2 freq painkiller (9) - 1 freq darrengrimes (9) - 2 freq stranmillis (9) - 1 freq barrelled (9) - 3 freq warrender (9) - 1 freq miller (10) - 56 freq pirriesmill's (10) - 1 freq mrmarkmillar (10) - 2 freq thriller (10) - 1 freq caterpillar (10) - 141 freq darnley (10) - 59 freq danielle (10) - 1 freq cairngill (10) - 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 - TRNMLR darrenmiller - 1 freq |
DARRENMILLER |
| Time to execute Levenshtein function - 0.248368 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.503052 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.030156 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.037989 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. |