| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| damp (0) - 83 freq jamp (1) - 34 freq dame (1) - 16 freq damt (1) - 2 freq damb (1) - 1 freq amp (1) - 10 freq dams (1) - 6 freq dampt (1) - 3 freq daep (1) - 1 freq damo (1) - 10 freq camp (1) - 53 freq lamp (1) - 79 freq dump (1) - 30 freq damn (1) - 73 freq dap (1) - 1 freq ramp (1) - 13 freq dam (1) - 28 freq champ (2) - 17 freq duma (2) - 1 freq happ (2) - 4 freq dads (2) - 19 freq daid (2) - 5 freq doms (2) - 3 freq kaip (2) - 2 freq rame (2) - 3 freq |
damp (0) - 83 freq dump (1) - 30 freq lamp (2) - 79 freq camp (2) - 53 freq ramp (2) - 13 freq dam (2) - 28 freq damo (2) - 10 freq dap (2) - 1 freq damn (2) - 73 freq damt (2) - 2 freq dame (2) - 16 freq daep (2) - 1 freq jamp (2) - 34 freq damb (2) - 1 freq dams (2) - 6 freq dampt (2) - 3 freq amp (2) - 10 freq dsp (3) - 1 freq mump (3) - 3 freq limp (3) - 19 freq rmp (3) - 1 freq cump (3) - 1 freq damper (3) - 3 freq dup (3) - 5 freq dowp (3) - 53 freq |
SoundEx code - D510 dounby - 3 freq dump - 30 freq doonbye - 4 freq dumb - 38 freq damp - 83 freq dounfaw - 5 freq dounbye - 1 freq dumpie - 1 freq dunbae - 2 freq demob - 3 freq doonby - 20 freq 'dumb - 2 freq doonfaa - 3 freq dump' - 1 freq dumbo - 2 freq dumphy - 50 freq damff - 1 freq doonfa - 2 freq danube - 1 freq dumfy - 3 freq dumba - 1 freq damb - 1 freq €œdumb - 1 freq dianeeva - 1 freq dunfy - 1 freq |
MetaPhone code - TMP dump - 30 freq damp - 83 freq dumpie - 1 freq tempo - 4 freq temp - 734 freq dump' - 1 freq timpo - 1 freq temp- - 7 freq |
DAMP |
| Time to execute Levenshtein function - 0.190606 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.351781 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.027845 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.037772 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.000854 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. |