| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| en-gedi (0) - 1 freq ended (3) - 70 freq eiged (3) - 1 freq engaged (3) - 19 freq eigged (3) - 1 freq enjyed (3) - 2 freq meneged (3) - 1 freq engels (3) - 1 freq enraged (3) - 4 freq engaged' (3) - 1 freq reneged (3) - 1 freq edged (3) - 9 freq egged (3) - 5 freq envied (3) - 3 freq engli (3) - 2 freq ensued (3) - 3 freq engert (3) - 1 freq -ed (4) - 1 freq mened (4) - 1 freq ronged (4) - 1 freq ensteyd (4) - 2 freq kennedy (4) - 23 freq nudged (4) - 5 freq empied (4) - 3 freq inked (4) - 4 freq |
en-gedi (0) - 1 freq enraged (4) - 4 freq engaged (4) - 19 freq nigged (5) - 1 freq nagged (5) - 3 freq een-tide (5) - 1 freq ingaed (5) - 5 freq nudged (5) - 5 freq on-gaan (5) - 1 freq unwaged (5) - 1 freq nidged (5) - 1 freq ane-eed (5) - 1 freq on-gaein (5) - 1 freq on-gaun (5) - 1 freq sun-god (5) - 1 freq ongaed (5) - 2 freq eiged (5) - 1 freq ended (5) - 70 freq reneged (5) - 1 freq engaged' (5) - 1 freq eigged (5) - 1 freq meneged (5) - 1 freq enjyed (5) - 2 freq egged (5) - 5 freq edged (5) - 9 freq |
SoundEx code - E523 enjoyed - 130 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 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 eemisstane - 2 freq emmaxdeex - 1 freq |
MetaPhone code - ENJT ehynged - 1 freq en-gedi - 1 freq enjoyt - 6 freq enjoy't - 2 freq |
EN-GEDI |
| Time to execute Levenshtein function - 0.437033 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.804491 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.065273 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.040288 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.052644 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. |