| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dental (0) - 7 freq dentals (1) - 1 freq mental (1) - 118 freq denial (1) - 14 freq 'dental (1) - 1 freq ental (1) - 1 freq rental (1) - 9 freq denyan (2) - 2 freq sentral (2) - 1 freq dently (2) - 1 freq derval (2) - 17 freq detail (2) - 42 freq deal (2) - 190 freq mentul (2) - 2 freq pentar (2) - 1 freq dented (2) - 2 freq entac (2) - 1 freq 'mental (2) - 1 freq dentie (2) - 6 freq entail (2) - 3 freq genital (2) - 1 freq donal (2) - 7 freq deval (2) - 4 freq mintal (2) - 1 freq denty (2) - 6 freq |
dental (0) - 7 freq rental (2) - 9 freq dentily (2) - 1 freq ental (2) - 1 freq dently (2) - 1 freq dentals (2) - 1 freq 'dental (2) - 1 freq mental (2) - 118 freq denial (2) - 14 freq denty (3) - 6 freq dent (3) - 4 freq mintal (3) - 1 freq donal (3) - 7 freq dettol (3) - 1 freq donnal (3) - 1 freq entel (3) - 3 freq genital (3) - 1 freq lentil (3) - 5 freq dentit (3) - 3 freq distal (3) - 2 freq dettel (3) - 1 freq dented (3) - 2 freq detail (3) - 42 freq mentul (3) - 2 freq entail (3) - 3 freq |
SoundEx code - D534 dandelion - 4 freq daintily - 2 freq dandelions - 1 freq dentals - 1 freq dental - 7 freq 'dental - 1 freq dentie-like - 1 freq dentie-lik - 1 freq dwindlin - 1 freq €˜dandelion - 1 freq dently - 1 freq dwindlin' - 1 freq dentily - 1 freq dwindling - 1 freq deanmadalba - 1 freq |
MetaPhone code - TNTL tentily - 22 freq 'tentily - 1 freq daintily - 2 freq tentilie - 8 freq dental - 7 freq 'dental - 1 freq tentillie - 2 freq tindal - 4 freq dently - 1 freq dentily - 1 freq |
DENTAL |
| Time to execute Levenshtein function - 0.290086 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.373122 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.027468 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.037260 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.000847 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. |