| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opted (0) - 5 freq outed (1) - 2 freq ooted (1) - 1 freq oped (1) - 1 freq opef (2) - 1 freq pied (2) - 4 freq outer (2) - 4 freq doped (2) - 2 freq spyed (2) - 3 freq open (2) - 735 freq jolted (2) - 5 freq cited (2) - 3 freq fited (2) - 1 freq rooted (2) - 12 freq copied (2) - 13 freq dooted (2) - 4 freq peed (2) - 8 freq pyed (2) - 20 freq rated (2) - 3 freq oates (2) - 1 freq meted (2) - 2 freq ped (2) - 2 freq roped (2) - 1 freq posted (2) - 21 freq topped (2) - 1 freq |
opted (0) - 5 freq ooted (2) - 1 freq oped (2) - 1 freq outed (2) - 2 freq pled (3) - 3 freq booted (3) - 6 freq rted (3) - 1 freq potted (3) - 4 freq footed (3) - 1 freq noted (3) - 23 freq doted (3) - 1 freq acted (3) - 9 freq dated (3) - 6 freq ptsd (3) - 6 freq gated (3) - 1 freq opined (3) - 5 freq sated (3) - 3 freq coated (3) - 4 freq fated (3) - 1 freq voted (3) - 41 freq doited (3) - 2 freq muted (3) - 8 freq toted (3) - 1 freq ostid (3) - 1 freq pitied (3) - 3 freq |
SoundEx code - O133 optit - 1 freq opted - 5 freq |
MetaPhone code - OPTT optit - 1 freq opted - 5 freq |
OPTED |
| Time to execute Levenshtein function - 0.195278 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.335176 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.027010 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.037174 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.000891 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. |