| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumpid (0) - 1 freq dumpit (1) - 6 freq dumpie (1) - 1 freq dumped (1) - 26 freq dumpin (1) - 5 freq dump'd (1) - 1 freq dumplin (2) - 25 freq humpin (2) - 1 freq lumpin (2) - 1 freq dumphy (2) - 50 freq jumpin (2) - 61 freq humphd (2) - 1 freq dumper (2) - 1 freq pumped (2) - 15 freq mumped (2) - 1 freq humpie (2) - 1 freq bumpin (2) - 9 freq dumpty (2) - 6 freq dumping (2) - 1 freq mumpin (2) - 6 freq dummie (2) - 1 freq pumpie (2) - 2 freq humped (2) - 2 freq bumped (2) - 23 freq lumped (2) - 2 freq |
dumpid (0) - 1 freq dumped (1) - 26 freq dumpin (2) - 5 freq dump'd (2) - 1 freq dumpie (2) - 1 freq dumpit (2) - 6 freq dump (3) - 31 freq jumped (3) - 68 freq humped (3) - 2 freq dumpised (3) - 4 freq bumped (3) - 23 freq dump' (3) - 1 freq dumpty (3) - 6 freq dumpled (3) - 1 freq dampit (3) - 1 freq dumps (3) - 14 freq lumped (3) - 2 freq pumped (3) - 15 freq mumped (3) - 1 freq dumphy (3) - 50 freq dumper (3) - 1 freq damned (4) - 40 freq tamped (4) - 1 freq lamped (4) - 2 freq dimple (4) - 1 freq |
SoundEx code - D513 damnpt - 1 freq dumped - 26 freq doonbeat - 1 freq dampt - 3 freq damp't - 1 freq dumpit - 6 freq dumpid - 1 freq dump'd - 1 freq dumpty - 6 freq doun-pit - 1 freq demption - 1 freq demobbed - 1 freq dumbit - 1 freq doonpitten - 1 freq doonpittan - 1 freq dampit - 1 freq dhammapada - 2 freq demobit - 1 freq dae-nae-better - 1 freq dumbwit - 1 freq damp-eyed - 1 freq dmfdesigns - 1 freq |
MetaPhone code - TMPT tempt - 9 freq dumped - 26 freq temptt - 1 freq dampt - 3 freq damp't - 1 freq dumpit - 6 freq dumpid - 1 freq dump'd - 1 freq tempit - 11 freq dumpty - 6 freq dampit - 1 freq tamped - 1 freq |
DUMPID |
| Time to execute Levenshtein function - 0.510165 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.814050 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.082461 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.088686 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.000903 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. |