Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
endy (0) - 8 freq andy (1) - 151 freq emdy (1) - 4 freq end' (1) - 1 freq enry (1) - 1 freq enjy (1) - 2 freq ende (1) - 3 freq end (1) - 1221 freq engy (1) - 2 freq indy (1) - 57 freq eny (1) - 7 freq enda (1) - 2 freq evdy (1) - 7 freq eddy (1) - 2 freq wendy (1) - 14 freq bendy (1) - 3 freq ends (1) - 97 freq gendy (1) - 1 freq envy (1) - 25 freq enj (2) - 1 freq enjoy (2) - 336 freq enjey (2) - 11 freq onty (2) - 3 freq ande (2) - 4 freq onny (2) - 3 freq |
endy (0) - 8 freq indy (1) - 57 freq end (1) - 1221 freq enda (1) - 2 freq andy (1) - 151 freq ende (1) - 3 freq and (2) - 25387 freq endue (2) - 1 freq ande (2) - 4 freq und (2) - 12 freq ond (2) - 1 freq undo (2) - 1 freq eind (2) - 1 freq eynd (2) - 1 freq inda (2) - 1 freq ando (2) - 1 freq needy (2) - 7 freq inde (2) - 4 freq nd (2) - 88 freq engy (2) - 2 freq enry (2) - 1 freq end' (2) - 1 freq enjy (2) - 2 freq eddy (2) - 2 freq wendy (2) - 14 freq |
SoundEx code - E530 end - 1221 freq emit - 4 freq enmity - 4 freq eynd - 1 freq endow - 2 freq entae - 43 freq ennit - 2 freq ent - 3 freq einaudi - 1 freq eened - 3 freq endy - 8 freq enda - 2 freq eind - 1 freq end' - 1 freq 'enewed - 1 freq ende - 3 freq emty - 3 freq een-twa - 2 freq een-at - 1 freq endue - 1 freq emdy - 4 freq emmett - 2 freq eyemouth - 1 freq eyemooth - 1 freq |
MetaPhone code - ENT end - 1221 freq eynd - 1 freq endow - 2 freq aeneid - 8 freq entae - 43 freq ennit - 2 freq ent - 3 freq einaudi - 1 freq eened - 3 freq endy - 8 freq enda - 2 freq eind - 1 freq end' - 1 freq ende - 3 freq een-at - 1 freq endue - 1 freq |
ENDY |
Time to execute Levenshtein function - 0.198673 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.391952 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.032219 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.041464 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.000936 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. |