Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
darleeng (0) - 2 freq darling (2) - 110 freq daeleens (2) - 1 freq sharleen (3) - 1 freq arlene (3) - 13 freq daring (3) - 1 freq carlene (3) - 1 freq saileens (3) - 1 freq faileens (3) - 1 freq dooeeng (3) - 1 freq dreenk (3) - 1 freq darlins (3) - 4 freq darjeeling (3) - 2 freq waileen (3) - 2 freq calleen (3) - 1 freq darien (3) - 8 freq feeleeng (3) - 2 freq darting (3) - 1 freq dateen (3) - 1 freq baleen (3) - 1 freq darlings (3) - 1 freq aileen (3) - 7 freq darken (3) - 3 freq darkens (3) - 1 freq darging (3) - 1 freq |
darleeng (0) - 2 freq darling (2) - 110 freq dirling (3) - 1 freq darlings (4) - 1 freq darting (4) - 1 freq darjeeling (4) - 2 freq darging (4) - 1 freq karling (4) - 1 freq carling (4) - 3 freq darlins (4) - 4 freq darning (4) - 1 freq darlin (4) - 54 freq daeleens (4) - 1 freq daring (4) - 1 freq derting (5) - 1 freq dring (5) - 1 freq dreeping (5) - 1 freq darena (5) - 3 freq dowling (5) - 1 freq doreen (5) - 3 freq dirlan (5) - 3 freq droning (5) - 1 freq dreenk (5) - 1 freq derlin (5) - 1 freq dealing (5) - 8 freq |
SoundEx code - D645 darlins - 4 freq drawlin - 7 freq darlin - 54 freq darling - 110 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 - TRLNK darling - 110 freq trailing - 6 freq darleeng - 2 freq dirling - 1 freq drooling - 2 freq trolling - 3 freq |
DARLEENG |
Time to execute Levenshtein function - 0.213497 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.357230 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.027494 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.037382 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.000847 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. |