| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| optit (0) - 1 freq optin (1) - 1 freq iftit (2) - 1 freq powtit (2) - 2 freq hopit (2) - 6 freq opui (2) - 1 freq poppit (2) - 1 freq ott (2) - 4 freq intit (2) - 11 freq orti (2) - 1 freq datit (2) - 6 freq jottit (2) - 1 freq oagit (2) - 5 freq hostit (2) - 7 freq option (2) - 56 freq ootfit (2) - 12 freq moutit (2) - 1 freq on-it (2) - 2 freq ptt (2) - 1 freq toppit (2) - 1 freq vottit (2) - 1 freq hootit (2) - 2 freq opsi (2) - 1 freq lootit (2) - 1 freq oleit (2) - 1 freq |
optit (0) - 1 freq poutit (2) - 1 freq ptt (2) - 1 freq petit (2) - 1 freq putit (2) - 2 freq optin (2) - 1 freq pitit (2) - 5 freq actit (3) - 9 freq poit (3) - 1 freq putt (3) - 28 freq routit (3) - 1 freq opint (3) - 1 freq 'tit (3) - 1 freq opt (3) - 2 freq bootit (3) - 2 freq dotit (3) - 1 freq opted (3) - 5 freq wytit (3) - 20 freq mutit (3) - 1 freq mootit (3) - 1 freq opent (3) - 88 freq emptit (3) - 1 freq eatit (3) - 1 freq doitit (3) - 13 freq antit (3) - 1 freq |
SoundEx code - O133 optit - 1 freq opted - 5 freq |
MetaPhone code - OPTT optit - 1 freq opted - 5 freq |
OPTIT |
| Time to execute Levenshtein function - 0.597617 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 - 1.276977 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.095673 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.122971 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.064397 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. |