Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
darling (0) - 110 freq karling (1) - 1 freq carling (1) - 3 freq dirling (1) - 1 freq darting (1) - 1 freq darlings (1) - 1 freq darning (1) - 1 freq darlins (1) - 4 freq daring (1) - 1 freq darging (1) - 1 freq darlin (1) - 54 freq carving (2) - 2 freq wailing (2) - 1 freq raring (2) - 2 freq daing (2) - 1 freq darling's (2) - 23 freq failing (2) - 2 freq railing (2) - 6 freq curling (2) - 3 freq bawling (2) - 1 freq erling (2) - 1 freq warbling (2) - 1 freq dring (2) - 1 freq derting (2) - 1 freq dancing (2) - 30 freq |
darling (0) - 110 freq dirling (1) - 1 freq daring (2) - 1 freq darging (2) - 1 freq darleeng (2) - 2 freq darlins (2) - 4 freq darlin (2) - 54 freq darning (2) - 1 freq karling (2) - 1 freq darting (2) - 1 freq darlings (2) - 1 freq carling (2) - 3 freq hurling (3) - 2 freq cairling (3) - 1 freq derting (3) - 1 freq drying (3) - 6 freq drooling (3) - 2 freq during (3) - 54 freq dring (3) - 1 freq derlins (3) - 1 freq dealing (3) - 8 freq birling (3) - 1 freq curling (3) - 3 freq dirlin (3) - 45 freq derlin (3) - 1 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 |
DARLING |
Time to execute Levenshtein function - 0.206878 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.354830 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.027106 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.037119 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.000796 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. |