| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ent (0) - 3 freq ena (1) - 16 freq hent (1) - 6 freq eat (1) - 467 freq went (1) - 1923 freq dent (1) - 4 freq nt (1) - 34 freq vent (1) - 6 freq eet (1) - 581 freq en (1) - 618 freq snt (1) - 1 freq en' (1) - 5 freq cent (1) - 20 freq enn (1) - 38 freq sent (1) - 546 freq eno (1) - 9 freq pent (1) - 39 freq rent (1) - 48 freq ›nt (1) - 2 freq ont (1) - 5 freq kent (1) - 1832 freq ens (1) - 16 freq ect (1) - 25 freq et (1) - 256 freq eng (1) - 10 freq |
ent (0) - 3 freq unt (1) - 1 freq ont (1) - 5 freq int (1) - 31 freq nt (1) - 34 freq yent (1) - 1 freq ant (1) - 8 freq onte (2) - 18 freq nit (2) - 10 freq ante (2) - 1 freq nat (2) - 21 freq unto (2) - 8 freq nyt (2) - 1 freq env (2) - 1 freq inti (2) - 218 freq anto (2) - 1 freq enj (2) - 1 freq ents (2) - 1 freq into (2) - 198 freq anat (2) - 1 freq elt (2) - 2 freq inte (2) - 129 freq tent (2) - 460 freq inty (2) - 21 freq aint (2) - 13 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 |
ENT |
| Time to execute Levenshtein function - 0.201105 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.382913 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.027916 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.037200 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.000960 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. |