Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
enda (0) - 2 freq enna (1) - 11 freq ende (1) - 3 freq endan (1) - 2 freq end' (1) - 1 freq snda (1) - 5 freq ena (1) - 16 freq end (1) - 1212 freq ends (1) - 96 freq inda (1) - 1 freq endy (1) - 8 freq en'a (1) - 1 freq dada (2) - 12 freq esa (2) - 2 freq bena (2) - 1 freq ‘nd (2) - 1 freq undo (2) - 1 freq enof (2) - 5 freq inla (2) - 1 freq kinda (2) - 175 freq tendan (2) - 1 freq senga (2) - 35 freq scda (2) - 2 freq fendt (2) - 2 freq enem (2) - 2 freq |
enda (0) - 2 freq endy (1) - 8 freq end (1) - 1212 freq inda (1) - 1 freq ende (1) - 3 freq andy (2) - 151 freq ond (2) - 1 freq und (2) - 12 freq needa (2) - 1 freq indy (2) - 57 freq nd (2) - 88 freq eind (2) - 1 freq ando (2) - 1 freq eynd (2) - 1 freq ande (2) - 4 freq undae (2) - 3 freq inde (2) - 4 freq and (2) - 25056 freq india (2) - 21 freq endue (2) - 1 freq undo (2) - 1 freq endan (2) - 2 freq end' (2) - 1 freq ends (2) - 96 freq en'a (2) - 1 freq |
SoundEx code - E530 end - 1212 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 - 1212 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 |
ENDA |
Time to execute Levenshtein function - 0.171004 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.349152 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.027823 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.038020 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.000917 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. |