Some words can be constructed from the set of these Symbols and some cannot.
For example "calculus" has two "elemental representations":
C Al C U Lu S
C Al Cu Lu S
Moreover we will add one point to a word's "score" for every letter in the word which can appear as the first letter of a two-letter symbol and also as the second letter of a two-letter symbol in different valid elemental representations of the same word.
The word "calculus" scores zero points because the only difference between its two reprentations is C U vs Cu.
On the other hand, "snow" can be:
S N O W
Sn O W
S No W
Since the letter "n" appears both in Sn and No, "snow" gets one point.
Your challenge: If k is the maximum score of the set of all words in the English language, try to find an example word for each score from 1 to k.
