| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| entail (0) - 3 freq entails (1) - 1 freq entaik (1) - 1 freq ental (1) - 1 freq emsail (2) - 5 freq ettil (2) - 22 freq entrie (2) - 5 freq entrim (2) - 4 freq ontil (2) - 53 freq oxtail (2) - 1 freq nail (2) - 46 freq mental (2) - 125 freq until (2) - 495 freq retail (2) - 7 freq dental (2) - 7 freq snail (2) - 33 freq entaels (2) - 1 freq estait (2) - 2 freq lentil (2) - 5 freq detail (2) - 43 freq entada (2) - 1 freq uptail (2) - 2 freq entel (2) - 3 freq entac (2) - 1 freq rental (2) - 9 freq |
entail (0) - 3 freq ental (1) - 1 freq until (2) - 495 freq entel (2) - 3 freq intil (2) - 554 freq ontil (2) - 53 freq entaik (2) - 1 freq entails (2) - 1 freq untul (3) - 1 freq rental (3) - 9 freq entac (3) - 1 freq entada (3) - 1 freq entae (3) - 43 freq intul (3) - 1 freq detail (3) - 43 freq oantil (3) - 1 freq tail (3) - 265 freq ently (3) - 2 freq uptail (3) - 2 freq nail (3) - 46 freq mental (3) - 125 freq lentil (3) - 5 freq intl (3) - 1 freq ettil (3) - 22 freq entrie (3) - 5 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 |
ENTAIL |
| Time to execute Levenshtein function - 0.212690 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.422994 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.027546 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.037714 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.000887 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. |