Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
elements (0) - 35 freq clements (1) - 1 freq elemints (1) - 1 freq element (1) - 45 freq 'elements' (2) - 1 freq eleventh (2) - 6 freq waements (2) - 1 freq laments (2) - 9 freq clement's (2) - 1 freq pyements (2) - 1 freq elementar (2) - 3 freq tenements (2) - 20 freq filaments (3) - 1 freq regiments (3) - 12 freq peyments (3) - 5 freq pleens (3) - 3 freq vestments (3) - 1 freq elephants (3) - 12 freq agiements (3) - 1 freq maments (3) - 1 freq prevents (3) - 1 freq lemes (3) - 2 freq glents (3) - 6 freq elegant (3) - 12 freq leven's (3) - 2 freq |
elements (0) - 35 freq elemints (1) - 1 freq clements (2) - 1 freq element (2) - 45 freq laments (2) - 9 freq pyements (3) - 1 freq elementar (3) - 3 freq waements (3) - 1 freq ailments (3) - 9 freq lemans (4) - 1 freq ailmints (4) - 1 freq lempets (4) - 2 freq leemets (4) - 1 freq lament (4) - 22 freq ments (4) - 1 freq waments (4) - 1 freq eliminates (4) - 1 freq mauments (4) - 1 freq elementary (4) - 4 freq lents (4) - 1 freq leemeets (4) - 1 freq payments (4) - 3 freq moments (4) - 42 freq tenements (4) - 20 freq filaments (4) - 1 freq |
SoundEx code - E455 elementary - 4 freq element - 45 freq eliminate - 2 freq elements - 35 freq 'elements' - 1 freq eliminates - 1 freq elemints - 1 freq eliminated - 1 freq elementar - 3 freq elaineyoung - 3 freq elmentalhealth - 3 freq elmundo - 2 freq |
MetaPhone code - ELMNTS elements - 35 freq 'elements' - 1 freq eliminates - 1 freq elemints - 1 freq |
ELEMENTS |
Time to execute Levenshtein function - 0.326545 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.505627 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.059987 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.037084 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.000910 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. |