| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dental (0) - 7 freq denial (1) - 14 freq 'dental (1) - 1 freq mental (1) - 125 freq ental (1) - 1 freq rental (1) - 9 freq dentals (1) - 1 freq dent (2) - 4 freq entail (2) - 3 freq dentie (2) - 6 freq penal (2) - 5 freq central (2) - 130 freq donnal (2) - 1 freq donal (2) - 7 freq devaal (2) - 5 freq lentil (2) - 5 freq denar (2) - 1 freq dettol (2) - 1 freq dentit (2) - 3 freq distal (2) - 2 freq dented (2) - 2 freq rentals (2) - 2 freq genral (2) - 4 freq entac (2) - 1 freq mentul (2) - 2 freq |
dental (0) - 7 freq dentily (2) - 1 freq dently (2) - 1 freq rental (2) - 9 freq dentals (2) - 1 freq mental (2) - 125 freq ental (2) - 1 freq denial (2) - 14 freq 'dental (2) - 1 freq mentul (3) - 2 freq dented (3) - 2 freq detail (3) - 43 freq distal (3) - 2 freq denty (3) - 6 freq mintal (3) - 1 freq dentit (3) - 3 freq dettel (3) - 1 freq entel (3) - 3 freq dettol (3) - 1 freq genital (3) - 1 freq dentie (3) - 6 freq entail (3) - 3 freq dent (3) - 4 freq donal (3) - 7 freq donnal (3) - 1 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.210659 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.373756 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.028666 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.037972 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.000876 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. |