Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ently (0) - 2 freq fently (1) - 1 freq entry (1) - 61 freq gently (1) - 83 freq dently (1) - 1 freq jentle (2) - 2 freq gentily (2) - 4 freq enry (2) - 1 freq onty (2) - 3 freq only (2) - 1876 freq unty (2) - 4 freq ettle (2) - 190 freq inty (2) - 21 freq jyntly (2) - 3 freq bentley (2) - 4 freq extry (2) - 3 freq antsy (2) - 1 freq etl (2) - 1 freq tentily (2) - 22 freq deftly (2) - 1 freq aptly (2) - 4 freq ettld (2) - 1 freq endy (2) - 8 freq ettlt (2) - 21 freq erly (2) - 3 freq |
ently (0) - 2 freq entel (2) - 3 freq neatly (2) - 26 freq ental (2) - 1 freq intl (2) - 1 freq fently (2) - 1 freq entry (2) - 61 freq gently (2) - 83 freq dently (2) - 1 freq engla (3) - 1 freq sentle (3) - 1 freq ents (3) - 1 freq anly (3) - 1 freq intay (3) - 3 freq aenly (3) - 1 freq huntly (3) - 29 freq engli (3) - 2 freq ingly (3) - 1 freq intry (3) - 3 freq onnly (3) - 37 freq enml (3) - 1 freq until (3) - 495 freq entity (3) - 17 freq ontil (3) - 53 freq intul (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 |
ENTLY |
Time to execute Levenshtein function - 0.468699 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.727939 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.075224 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.037564 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.000857 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. |