| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ensuite (0) - 1 freq en-suite (1) - 1 freq ensuin (2) - 4 freq onsite (2) - 1 freq ensure (2) - 19 freq enspyte (2) - 1 freq enquire (2) - 4 freq inspite (2) - 3 freq endite (2) - 1 freq suite (2) - 16 freq envie (3) - 2 freq €˜shite (3) - 1 freq excuise (3) - 10 freq shite (3) - 325 freq sute (3) - 1 freq skite (3) - 43 freq nuit' (3) - 1 freq endoits (3) - 1 freq eneaise (3) - 1 freq ensyde (3) - 4 freq ennit (3) - 2 freq suitet (3) - 3 freq enshore (3) - 2 freq encaise (3) - 1 freq entrie (3) - 5 freq |
ensuite (0) - 1 freq onsite (2) - 1 freq en-suite (2) - 1 freq suite (3) - 16 freq endite (3) - 1 freq inspite (3) - 3 freq ensuin (3) - 4 freq ensure (3) - 19 freq enspyte (3) - 1 freq inset (4) - 2 freq inside (4) - 569 freq onside (4) - 2 freq noust (4) - 2 freq inite (4) - 6 freq density (4) - 4 freq erste (4) - 1 freq annuity (4) - 2 freq indite (4) - 1 freq kensit (4) - 1 freq enster (4) - 2 freq entity (4) - 17 freq nite (4) - 87 freq endyte (4) - 2 freq densitie (4) - 1 freq unite (4) - 11 freq |
SoundEx code - E523 enjoyed - 135 freq enjeyed - 3 freq enmaist - 1 freq einstein - 7 freq ehynged - 1 freq en-gedi - 1 freq ensyde - 4 freq enstructien's - 1 freq eensidint - 1 freq ensident - 1 freq eensident - 1 freq ennct - 1 freq ensyde's - 1 freq eenstrumint - 1 freq ensteyd - 2 freq enster - 2 freq eemisstane - 3 freq en'ught - 1 freq enjoyt - 6 freq enjoy't - 2 freq eonsiderin - 1 freq enactin' - 1 freq emsket - 1 freq enackit - 2 freq enjoyit - 2 freq enjyed - 2 freq enactit - 3 freq en-suite - 1 freq ensued - 3 freq emaciated - 2 freq enactments - 1 freq enactin - 1 freq ensuite - 1 freq eamiesdubd - 1 freq euaneast - 1 freq emmaxdeex - 1 freq |
MetaPhone code - ENST ensyde - 4 freq en-suite - 1 freq ensued - 3 freq ensuite - 1 freq euaneast - 1 freq |
ENSUITE |
| Time to execute Levenshtein function - 0.319038 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.611289 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.063679 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.037712 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.000898 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. |