| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ental (0) - 1 freq dental (1) - 7 freq entail (1) - 3 freq entac (1) - 1 freq entae (1) - 43 freq rental (1) - 9 freq entel (1) - 3 freq mental (1) - 125 freq ents (2) - 1 freq entaik (2) - 1 freq lentil (2) - 5 freq ectual (2) - 3 freq ena (2) - 16 freq untae (2) - 13 freq 'dental (2) - 1 freq central (2) - 130 freq eitan (2) - 1 freq dentals (2) - 1 freq nal (2) - 1 freq bengal (2) - 2 freq rentals (2) - 2 freq until (2) - 495 freq onta (2) - 2 freq entry (2) - 61 freq 'mental (2) - 1 freq |
ental (0) - 1 freq entel (1) - 3 freq entail (1) - 3 freq ently (2) - 2 freq natal (2) - 2 freq until (2) - 495 freq untul (2) - 1 freq ontil (2) - 53 freq intil (2) - 554 freq intl (2) - 1 freq intul (2) - 1 freq mental (2) - 125 freq rental (2) - 9 freq entac (2) - 1 freq dental (2) - 7 freq entae (2) - 43 freq enter (3) - 74 freq ent (3) - 3 freq total (3) - 98 freq metal (3) - 92 freq nial (3) - 4 freq fatal (3) - 6 freq genital (3) - 1 freq mintal (3) - 1 freq neal (3) - 1 freq |
SoundEx code - E534 endless - 52 freq endlessly - 3 freq eandle - 1 freq endlang - 4 freq ental - 1 freq entel - 3 freq ently - 2 freq end-all - 1 freq entail - 3 freq endliss - 1 freq endling - 1 freq endlich - 1 freq entails - 1 freq endlesslie - 1 freq entaels - 1 freq endlfee - 1 freq |
MetaPhone code - ENTL eandle - 1 freq ental - 1 freq entel - 3 freq ently - 2 freq end-all - 1 freq entail - 3 freq |
ENTAL |
| Time to execute Levenshtein function - 0.265001 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.375023 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.027781 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.039524 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.001014 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. |