| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elevate (0) - 2 freq elevated (1) - 2 freq relegate (2) - 2 freq levite (2) - 2 freq delegate (2) - 3 freq elevator (2) - 6 freq elevatin (2) - 1 freq cremate (3) - 1 freq elegant (3) - 12 freq senate (3) - 8 freq delegated (3) - 2 freq negate (3) - 2 freq cleane (3) - 1 freq berate (3) - 1 freq leave (3) - 462 freq uelefare (3) - 1 freq televise (3) - 1 freq revote (3) - 1 freq please (3) - 559 freq equate (3) - 5 freq relevance (3) - 5 freq evade (3) - 2 freq hiegate (3) - 1 freq eelebrate (3) - 1 freq cleavage (3) - 8 freq |
elevate (0) - 2 freq levite (2) - 2 freq elevated (2) - 2 freq elevatin (3) - 1 freq levit (3) - 2 freq elevator (3) - 6 freq salivate (4) - 1 freq leivit (4) - 3 freq eleevan (4) - 1 freq elect (4) - 9 freq leviet (4) - 1 freq luvit (4) - 1 freq legat (4) - 1 freq locate (4) - 2 freq evite (4) - 12 freq belevit (4) - 1 freq olate (4) - 1 freq leve (4) - 2 freq elvire (4) - 4 freq eleven (4) - 38 freq elevation (4) - 3 freq alienate (4) - 1 freq elite (4) - 22 freq leevit (4) - 4 freq evyte (4) - 2 freq |
SoundEx code - E413 elevator - 6 freq elevators - 1 freq elevated - 2 freq elbaed - 1 freq elliptiecal - 1 freq elufted - 1 freq elevate - 2 freq elevation - 3 freq elevatin - 1 freq |
MetaPhone code - ELFT elevate - 2 freq |
ELEVATE |
| Time to execute Levenshtein function - 0.187397 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.357210 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.027720 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.037097 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.000905 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. |