Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eynd (0) - 1 freq weynd (1) - 1 freq vynd (1) - 4 freq meynd (1) - 1 freq kynd (1) - 24 freq eyne (1) - 5 freq wynd (1) - 14 freq mynd (1) - 255 freq hynd (1) - 1 freq synd (1) - 4 freq end (1) - 1221 freq eyed (1) - 21 freq eyn (1) - 137 freq heynd (1) - 1 freq eyns (1) - 7 freq eind (1) - 1 freq ecn (2) - 2 freq enno (2) - 6 freq lyne (2) - 21 freq enna (2) - 11 freq eno (2) - 9 freq aind (2) - 1 freq yud (2) - 1 freq ens (2) - 16 freq lyno (2) - 2 freq |
eynd (0) - 1 freq end (1) - 1221 freq eind (1) - 1 freq und (2) - 12 freq yond (2) - 1 freq aind (2) - 1 freq ende (2) - 3 freq iand (2) - 1 freq ond (2) - 1 freq endy (2) - 8 freq aand (2) - 1 freq nd (2) - 88 freq enda (2) - 2 freq and (2) - 25387 freq aund (2) - 2 freq eened (2) - 3 freq yyned (2) - 2 freq wynd (2) - 14 freq mynd (2) - 255 freq eyne (2) - 5 freq kynd (2) - 24 freq vynd (2) - 4 freq meynd (2) - 1 freq hynd (2) - 1 freq synd (2) - 4 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 |
EYND |
Time to execute Levenshtein function - 0.196426 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.346155 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.027884 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.037140 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.000868 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. |