| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dhammapada (0) - 2 freq dhadakata (4) - 3 freq hamada (4) - 1 freq muhammad (5) - 2 freq hamemade (5) - 2 freq champed (5) - 2 freq tammata (5) - 1 freq 'hahahaha (5) - 1 freq haparanda (5) - 1 freq deanmadalba (5) - 1 freq dalriada (5) - 8 freq dharamsala (5) - 1 freq dammed (5) - 2 freq hammarby (5) - 1 freq dtammcd (5) - 1 freq amminadab (5) - 7 freq hame-made (5) - 11 freq marmalade (5) - 12 freq hahahaha (5) - 7 freq dharmendra (5) - 1 freq 'amanda (5) - 1 freq haaaa (5) - 2 freq tarmacadam (5) - 2 freq whammled (5) - 1 freq 'hardrada (5) - 1 freq |
dhammapada (0) - 2 freq dammed (7) - 2 freq whammled (7) - 1 freq hammered (7) - 13 freq champed (7) - 2 freq dtammcd (7) - 1 freq hamada (7) - 1 freq muhammad (7) - 2 freq hamemade (7) - 2 freq hmmph (8) - 8 freq shimmered (8) - 2 freq mohammed (8) - 1 freq drummed (8) - 8 freq dumped (8) - 26 freq chummed (8) - 1 freq humped (8) - 2 freq haimmered (8) - 4 freq 'hmmph (8) - 2 freq homemade (8) - 3 freq thummoxed (8) - 1 freq hemmered (8) - 4 freq dammeyged (8) - 1 freq thumped (8) - 5 freq whummled (8) - 7 freq drummond (8) - 6 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 - THMPT dhammapada - 2 freq |
DHAMMAPADA |
| Time to execute Levenshtein function - 0.693813 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 - 1.593240 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.112208 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.197578 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.000992 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. |