| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| engisl (0) - 1 freq engish (1) - 2 freq ingil (2) - 5 freq egil (2) - 4 freq endish (2) - 1 freq english (2) - 1469 freq gengis (2) - 1 freq ngist (2) - 2 freq englis (2) - 6 freq tengist (2) - 5 freq engine (2) - 50 freq enlist (2) - 1 freq until (3) - 495 freq endit (3) - 55 freq yogis (3) - 1 freq inglish (3) - 156 freq encaise (3) - 1 freq nuisle (3) - 1 freq ingest (3) - 2 freq endin' (3) - 1 freq noisy (3) - 13 freq eivill (3) - 1 freq bengal (3) - 2 freq singil (3) - 34 freq eisy (3) - 1 freq |
engisl (0) - 1 freq engish (2) - 2 freq ngist (3) - 2 freq ingil (3) - 5 freq ngs (4) - 1 freq anguish (4) - 5 freq engli (4) - 2 freq ingest (4) - 2 freq gisli (4) - 6 freq 'gisli (4) - 1 freq angst (4) - 4 freq yingist (4) - 1 freq njsl (4) - 1 freq nuisle (4) - 1 freq angel (4) - 113 freq angus (4) - 120 freq ingl (4) - 1 freq tengist (4) - 5 freq englis (4) - 6 freq nasl (4) - 1 freq enlist (4) - 1 freq engine (4) - 50 freq gengis (4) - 1 freq english (4) - 1469 freq engla (4) - 1 freq |
SoundEx code - E522 enjoys - 17 freq enough's - 3 freq engaged - 19 freq enjoys-an - 1 freq eemages - 15 freq enseeists - 1 freq engagements - 3 freq encaise - 1 freq encyclopedia - 4 freq engaged' - 1 freq engage - 40 freq engish - 2 freq ehanges - 1 freq emojis - 1 freq engagin - 16 freq enxious - 4 freq eunuchs - 2 freq enjoys't - 1 freq encased - 2 freq engaging - 4 freq engagement - 28 freq encyclopaedia - 5 freq enjoses - 1 freq enjose - 3 freq eimages - 8 freq enjosed - 5 freq 'enough's - 2 freq engagin' - 4 freq engagerment - 1 freq engages - 3 freq enseignies - 1 freq enjoy's - 1 freq ensues - 2 freq enjogh - 1 freq €˜engage - 1 freq eeemages - 1 freq engaigne - 1 freq enjosin - 1 freq ensignie - 1 freq engisl - 1 freq eunisjassemi - 2 freq euanmcgachie - 1 freq |
MetaPhone code - ENJSL engisl - 1 freq |
ENGISL |
| Time to execute Levenshtein function - 0.265344 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.584910 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.028854 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.074167 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.000920 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. |