Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
enhances (0) - 1 freq enhance (1) - 15 freq enhanced (1) - 2 freq ehanges (2) - 1 freq entrances (2) - 1 freq chances (2) - 60 freq nuances (2) - 3 freq exhales (3) - 1 freq inhales (3) - 1 freq penance (3) - 2 freq dances (3) - 43 freq enchanted (3) - 1 freq enrages (3) - 2 freq 'nance (3) - 1 freq changes (3) - 58 freq enables (3) - 1 freq endanger (3) - 1 freq shanes (3) - 1 freq johannes (3) - 1 freq echaes (3) - 2 freq advances (3) - 6 freq menaces (3) - 1 freq chancer (3) - 19 freq chunces (3) - 8 freq nonces (3) - 2 freq |
enhances (0) - 1 freq enhanced (2) - 2 freq enhance (2) - 15 freq nuances (3) - 3 freq chances (3) - 60 freq chunces (4) - 8 freq chaunces (4) - 6 freq nonces (4) - 2 freq nancies (4) - 1 freq entrances (4) - 1 freq ehanges (4) - 1 freq chancers (5) - 3 freq hance (5) - 2 freq instances (5) - 28 freq finances (5) - 6 freq sentences (5) - 43 freq scances (5) - 4 freq chance (5) - 548 freq stances (5) - 4 freq frances (5) - 11 freq engines (5) - 13 freq chancel (5) - 1 freq nance's (5) - 1 freq lances (5) - 1 freq announces (5) - 12 freq |
SoundEx code - E552 enemies - 37 freq enemas - 1 freq eenins - 2 freq enhance - 15 freq enhancing - 1 freq enunclated - 1 freq enunciatin - 1 freq emancipator - 1 freq eamonnss - 1 freq enhanced - 2 freq enhances - 1 freq eumenius - 1 freq enemy's - 1 freq eamonns - 1 freq |
MetaPhone code - ENHNSS enhances - 1 freq |
ENHANCES |
Time to execute Levenshtein function - 0.363599 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.720156 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.063742 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.059902 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.001265 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. |