| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dump (0) - 30 freq rump (1) - 10 freq dumps (1) - 14 freq gump (1) - 1 freq jump (1) - 84 freq dump' (1) - 1 freq dup (1) - 5 freq mump (1) - 3 freq sump (1) - 3 freq pump (1) - 29 freq lump (1) - 62 freq dumb (1) - 38 freq bump (1) - 23 freq duma (1) - 1 freq cump (1) - 1 freq hump (1) - 15 freq damp (1) - 83 freq dum (1) - 14 freq eum (2) - 1 freq comp (2) - 3 freq uup (2) - 4 freq dumpid (2) - 1 freq uzp (2) - 1 freq damb (2) - 1 freq sum (2) - 416 freq |
dump (0) - 30 freq damp (1) - 83 freq cump (2) - 1 freq duma (2) - 1 freq bump (2) - 23 freq hump (2) - 15 freq dumpie (2) - 1 freq rump (2) - 10 freq dumps (2) - 14 freq dumb (2) - 38 freq dum (2) - 14 freq dump' (2) - 1 freq jump (2) - 84 freq lump (2) - 62 freq dup (2) - 5 freq gump (2) - 1 freq pump (2) - 29 freq sump (2) - 3 freq mump (2) - 3 freq diep (3) - 3 freq dip (3) - 21 freq jumpe (3) - 1 freq dp (3) - 3 freq dupe (3) - 1 freq pomp (3) - 2 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 |
DUMP |
| Time to execute Levenshtein function - 0.226202 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.382061 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.029232 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.041248 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.000825 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. |