| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| danglin (0) - 16 freq dangin (1) - 1 freq janglin (1) - 1 freq canglin (1) - 1 freq danglin' (1) - 1 freq anglin (1) - 2 freq dakklin (2) - 1 freq manglit (2) - 3 freq tanglit (2) - 1 freq dancin (2) - 138 freq janglin' (2) - 1 freq dargin (2) - 7 freq cantlin (2) - 1 freq haiglin (2) - 3 freq gangin (2) - 72 freq dawdlin (2) - 2 freq dingyin (2) - 1 freq dangly (2) - 1 freq spanglin (2) - 1 freq jinglin (2) - 11 freq dalin (2) - 4 freq branglin (2) - 2 freq bangin (2) - 41 freq langin (2) - 7 freq singlin (2) - 1 freq |
danglin (0) - 16 freq danglin' (2) - 1 freq canglin (2) - 1 freq anglin (2) - 2 freq janglin (2) - 1 freq dangin (2) - 1 freq dangled (3) - 2 freq dingin (3) - 59 freq pinglin (3) - 1 freq singlin (3) - 1 freq draiglin (3) - 1 freq minglin (3) - 2 freq dangles (3) - 1 freq anglian (3) - 1 freq jinglin (3) - 11 freq dunlin (3) - 2 freq danglies (3) - 2 freq dinnlin (3) - 2 freq tinglin (3) - 7 freq dangly (3) - 1 freq dingyin (3) - 1 freq mangin (4) - 13 freq hangin (4) - 29 freq danssin (4) - 2 freq spanglin (4) - 1 freq |
SoundEx code - D524 dwingle't - 1 freq dinkly - 5 freq ding-a-ling - 1 freq dingle - 7 freq dingwall - 6 freq danglin - 16 freq dangult - 1 freq dangul - 1 freq danglin' - 1 freq dinnygal - 2 freq dunkellie - 8 freq dangles - 1 freq dunkeld - 7 freq dangly - 1 freq demsels - 32 freq 'dangly - 1 freq dangled - 2 freq dunnygal - 1 freq dunkle - 1 freq dunghill - 1 freq de-anglicisms - 1 freq damishell - 2 freq donegal - 7 freq dimsels - 1 freq dancehall - 1 freq daimselflees - 1 freq deangillan - 3 freq danglies - 2 freq diangelo - 1 freq daahenglish - 2 freq donegaldrift - 6 freq |
MetaPhone code - TNKLN tinklin - 4 freq tinglan - 3 freq tinglin - 7 freq danglin - 16 freq danglin' - 1 freq teenklin - 1 freq tinklhn - 1 freq tinklan - 2 freq tinglin' - 1 freq |
DANGLIN |
| Time to execute Levenshtein function - 0.226633 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.406451 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.032935 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.041861 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.001127 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. |