| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dimriv (0) - 3 freq driv (2) - 12 freq diarie (2) - 1 freq dhriv (2) - 5 freq dimmin (2) - 3 freq imrie (2) - 1 freq dimwit (2) - 2 freq dievin (3) - 1 freq dumpit (3) - 6 freq gimin (3) - 2 freq dirt' (3) - 1 freq dirks (3) - 4 freq simmit (3) - 6 freq distie (3) - 1 freq dire (3) - 9 freq jimpit (3) - 5 freq dearie (3) - 37 freq dmi (3) - 1 freq divid (3) - 10 freq damnin (3) - 2 freq imid (3) - 1 freq damnit (3) - 5 freq dizzie (3) - 2 freq pirrie (3) - 1 freq birrit (3) - 3 freq |
dimriv (0) - 3 freq dhriv (3) - 5 freq driv (3) - 12 freq drive (4) - 167 freq dhrive (4) - 4 freq druv (4) - 1 freq deprive (4) - 3 freq derive (4) - 2 freq diarie (4) - 1 freq imrie (4) - 1 freq dimmin (4) - 3 freq dimwit (4) - 2 freq maiv (5) - 1 freq dummie (5) - 1 freq div (5) - 506 freq dirge (5) - 5 freq dirt (5) - 69 freq maimrie (5) - 2 freq dumpid (5) - 1 freq ydqrov (5) - 1 freq diary (5) - 43 freq mri (5) - 1 freq admir (5) - 1 freq demit (5) - 2 freq debris (5) - 10 freq |
SoundEx code - D561 doonriver - 2 freq dimriv - 3 freq denner-brod - 1 freq |
MetaPhone code - TMRF dimriv - 3 freq |
DIMRIV |
| Time to execute Levenshtein function - 0.195858 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.363644 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.027503 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.038771 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.000875 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. |