| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dampt (0) - 3 freq damp (1) - 83 freq damnt (1) - 15 freq dampit (1) - 1 freq damt (1) - 2 freq damp't (1) - 1 freq jampt (1) - 1 freq dam't (1) - 1 freq damnpt (1) - 1 freq campt (1) - 2 freq dappit (2) - 1 freq dawpit (2) - 1 freq dump' (2) - 1 freq camps (2) - 15 freq davit (2) - 23 freq damij (2) - 1 freq lampit (2) - 1 freq camp (2) - 53 freq dump (2) - 30 freq damnit (2) - 5 freq hempt (2) - 1 freq jumpt (2) - 8 freq bampot (2) - 30 freq appt (2) - 1 freq dawit (2) - 2 freq |
dampt (0) - 3 freq dampit (1) - 1 freq campt (2) - 2 freq dumpty (2) - 6 freq dumpit (2) - 6 freq dam't (2) - 1 freq damnpt (2) - 1 freq jampt (2) - 1 freq damnt (2) - 15 freq damt (2) - 2 freq damp (2) - 83 freq damp't (2) - 1 freq damper (3) - 3 freq pumpt (3) - 1 freq adapt (3) - 6 freq rampit (3) - 2 freq dampen (3) - 1 freq dammit (3) - 9 freq daupit (3) - 3 freq compt (3) - 1 freq damart (3) - 1 freq dept (3) - 7 freq mumpt (3) - 2 freq jimpt (3) - 1 freq tempt (3) - 8 freq |
SoundEx code - D513 damnpt - 1 freq dumped - 21 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 - 8 freq dumped - 21 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 |
DAMPT |
| Time to execute Levenshtein function - 0.175438 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.336437 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.027680 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.041558 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.001163 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. |