Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dirling (0) - 1 freq birling (1) - 1 freq darling (1) - 111 freq dirlin (1) - 45 freq tirlin (2) - 13 freq dishing (2) - 3 freq birring (2) - 1 freq tilling (2) - 1 freq airline (2) - 1 freq killing (2) - 7 freq sibling (2) - 1 freq darting (2) - 1 freq filling (2) - 5 freq dirlit (2) - 1 freq skirling (2) - 1 freq hurling (2) - 2 freq airing (2) - 1 freq wirking (2) - 4 freq derlins (2) - 1 freq firming (2) - 1 freq kipling (2) - 3 freq hirlin (2) - 1 freq irving (2) - 1 freq aisling (2) - 1 freq filing (2) - 1 freq |
dirling (0) - 1 freq darling (1) - 111 freq birling (2) - 1 freq dirlin (2) - 45 freq carling (3) - 3 freq drying (3) - 6 freq derlins (3) - 1 freq idling (3) - 1 freq darning (3) - 1 freq dring (3) - 1 freq derting (3) - 1 freq cairling (3) - 1 freq during (3) - 55 freq drooling (3) - 2 freq darlings (3) - 1 freq darlins (3) - 4 freq erling (3) - 1 freq daring (3) - 1 freq curling (3) - 3 freq darging (3) - 1 freq karling (3) - 1 freq darleeng (3) - 2 freq dowling (3) - 1 freq darlin (3) - 55 freq dirlan (3) - 3 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 - TRLNK darling - 111 freq trailing - 6 freq darleeng - 2 freq dirling - 1 freq drooling - 2 freq trolling - 3 freq |
DIRLING |
Time to execute Levenshtein function - 0.241576 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.402236 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.029379 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.043329 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.000979 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. |