| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| element (0) - 45 freq elements (1) - 35 freq cement (2) - 27 freq mevement (2) - 1 freq elemints (2) - 1 freq eleven (2) - 36 freq emerent (2) - 1 freq bellement (2) - 3 freq waement (2) - 1 freq lemen (2) - 1 freq sleent (2) - 1 freq clements (2) - 1 freq elementar (2) - 3 freq eleevent (2) - 1 freq lament (2) - 21 freq leent (2) - 26 freq tenement (2) - 21 freq elegant (2) - 12 freq 'lament (2) - 3 freq easement (2) - 9 freq eleventh (2) - 6 freq elephint (3) - 1 freq cleert (3) - 1 freq cleen (3) - 3 freq pleen (3) - 1 freq |
element (0) - 45 freq lament (2) - 21 freq elements (2) - 35 freq elegant (3) - 12 freq eleevent (3) - 1 freq easement (3) - 9 freq lamont (3) - 8 freq elementar (3) - 3 freq 'lament (3) - 3 freq leent (3) - 26 freq elemints (3) - 1 freq ailment (3) - 2 freq waement (3) - 1 freq lemen (3) - 1 freq cement (3) - 27 freq leavent (4) - 1 freq laminit (4) - 1 freq memento (4) - 1 freq eloquent (4) - 3 freq meent (4) - 22 freq ment (4) - 18 freq leman (4) - 3 freq lamante (4) - 1 freq lempit (4) - 2 freq moment (4) - 225 freq |
SoundEx code - E455 elementary - 4 freq element - 45 freq eliminate - 2 freq elements - 35 freq 'elements' - 1 freq elemints - 1 freq eliminated - 1 freq elementar - 3 freq elaineyoung - 3 freq elmentalhealth - 3 freq elmundo - 2 freq |
MetaPhone code - ELMNT element - 45 freq eliminate - 2 freq elmundo - 2 freq |
ELEMENT |
| Time to execute Levenshtein function - 0.182255 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.324988 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.027109 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.037292 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.000832 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. |