Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dangled (0) - 2 freq wangled (1) - 1 freq mangled (1) - 6 freq tangled (1) - 10 freq dangles (1) - 1 freq fangled (1) - 3 freq jangle (2) - 5 freq dunged (2) - 1 freq fang'led (2) - 1 freq dingyed (2) - 1 freq langed (2) - 13 freq han'led (2) - 1 freq waggled (2) - 2 freq mungled (2) - 1 freq danglies (2) - 2 freq darged (2) - 1 freq hanged (2) - 6 freq danger (2) - 110 freq mantled (2) - 1 freq ganged (2) - 22 freq dangly (2) - 1 freq dingied (2) - 3 freq daidled (2) - 1 freq draigled (2) - 1 freq ganglee (2) - 1 freq |
dangled (0) - 2 freq wangled (2) - 1 freq dangles (2) - 1 freq fangled (2) - 3 freq mangled (2) - 6 freq tangled (2) - 10 freq dinged (3) - 18 freq draigled (3) - 1 freq dingied (3) - 3 freq singled (3) - 1 freq danglin (3) - 16 freq dangly (3) - 1 freq mingled (3) - 6 freq tingled (3) - 1 freq dingle (3) - 7 freq mungled (3) - 1 freq dingyed (3) - 1 freq dunged (3) - 1 freq danglies (3) - 2 freq tangles (4) - 3 freq dwanged (4) - 1 freq dazzled (4) - 2 freq tangoed (4) - 1 freq mangle (4) - 4 freq handled (4) - 7 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 - TNKLT tanglit - 1 freq tangl't - 3 freq tanglet - 1 freq tingled - 1 freq tinkled - 4 freq tangled - 10 freq dangult - 1 freq dunkeld - 7 freq dangled - 2 freq tinkelt - 1 freq tanglt - 1 freq |
DANGLED |
Time to execute Levenshtein function - 0.256616 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.466119 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.031672 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.056113 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.001506 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. |