| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drawlin-th (0) - 1 freq drawlin-the (1) - 1 freq drawlin (3) - 7 freq drawlan-e (3) - 1 freq draalin-da (3) - 1 freq drawins (4) - 11 freq drawing (4) - 18 freq rawlin (4) - 1 freq drawlan (4) - 1 freq brawlin' (4) - 1 freq trawlin (4) - 12 freq drawin (4) - 119 freq brawtith (4) - 1 freq drawin' (4) - 2 freq crawlin (4) - 19 freq drainit (4) - 4 freq drawin's (4) - 1 freq crawling (4) - 1 freq crawlin' (4) - 2 freq drawings (4) - 1 freq draalin (4) - 2 freq drain't (4) - 1 freq draint (4) - 5 freq crowlin (5) - 3 freq lingth (5) - 2 freq |
drawlin-th (0) - 1 freq drawlin-the (1) - 1 freq drawlan-e (5) - 1 freq draalin-da (6) - 1 freq drawlin (6) - 7 freq drawlan (7) - 1 freq draint (8) - 5 freq draalin (8) - 2 freq drawings (8) - 1 freq drain't (8) - 1 freq darlington (8) - 1 freq drawlin-mester (8) - 1 freq bairn-th (8) - 1 freq crawling (8) - 1 freq drawin-room (8) - 2 freq drowth (8) - 1 freq crawlin' (8) - 2 freq brawlin' (8) - 1 freq drawin's (8) - 1 freq rawlin (8) - 1 freq drawing (8) - 18 freq drawins (8) - 11 freq drawin (8) - 119 freq trawlin (8) - 12 freq drawin' (8) - 2 freq |
SoundEx code - D645 darlins - 4 freq drawlin - 7 freq darlin - 55 freq darling - 111 freq dirlin - 45 freq droolin' - 1 freq drawlin-the - 1 freq drawlin-maister - 2 freq dreelin - 1 freq darlin's' - 1 freq droolin - 3 freq 'darlin - 1 freq derlins - 1 freq derlin - 1 freq drawlin-th - 1 freq drawlin-mester - 1 freq drillin - 13 freq darleeng - 2 freq 'darlin' - 1 freq draalin-da - 1 freq draalin - 2 freq dirlan - 3 freq darling's - 23 freq darlings - 1 freq drawlan-e - 1 freq drawlan-master - 1 freq drawlan - 1 freq dreillin - 1 freq dirling - 1 freq drooling - 2 freq derailment - 2 freq darrylnaismithx - 1 freq dirlins - 1 freq darlington - 1 freq |
MetaPhone code - TRLN0 drawlin-the - 1 freq drawlin-th - 1 freq |
DRAWLIN-TH |
| Time to execute Levenshtein function - 0.201956 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.429442 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.029618 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.038782 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.000954 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. |