# What is an EEEEE Word™?

In the spirit of the What is a Word™/Phrase™ series started by JLee, a special brand of Phrase™ and Word™ puzzles.

If a word conforms to a special rule, I call it an EEEEE Word™.
Use the examples below to find the rule.

$$% set Title text. (spaces around the text ARE important; do not remove.) % increase Pad value only if your entries are longer than the title bar. % \def\Pad{\P{0.0}} \def\Title{\textbf{ EEEEE }} % \def\S#1#2{\Space{#1}{20px}{#2px}}\def\P#1{\V{#1em}}\ \def\V#1{\S{#1}{9}} \def\T{\Title\textbf{Words }^™\Pad}\def\NT{\Pad\textbf{Not}\T\ }\displaystyle \smash{\lower{29px}\bbox[yellow]{\phantom{\rlap{rubio.2017.02.04}\S{6px}{0} \begin{array}{cc}\Pad\T&\NT\\\end{array}}}}\atop\def\V#1{\S{#1}{5}} \begin{array}{|c|c|}\hline\Pad\T&\NT\\\hline % \text{ ADEXE }&\text{ NAU }\\ \hline \text{ ATWIST }&\text{ ATWIRL }\\ \hline \text{ BISTRO }&\text{ CAFE }\\ \hline \text{ CHAI }&\text{ LATTE }\\ \hline \text{ CODEX }&\text{ MANUSCRIPT }\\ \hline \text{ CON }&\text{ PRO }\\ \hline \text{ ESTRUS }&\text{ HEAT }\\ \hline \text{ FEINTS }&\text{ STABS }\\ \hline \text{ GOTCHA }&\text{ SNAFU }\\ \hline \text{ INDEX }&\text{ UNINDEXED }\\ \hline \text{ JEWISH }&\text{ GENTILE }\\ \hline \text{ MOCHA }&\text{ FRAPPE }\\ \hline \text{ NINTH }&\text{ SIXTH }\\ \hline \text{ PASTRY }&\text{ COOKIE }\\ \hline \text{ QUAINT }&\text{ CHARMING }\\ \hline \text{ RECONS }&\text{ SORTIES }\\ \hline \text{ SCONES }&\text{ TARTS }\\ \hline \text{ SWISH }&\text{ TWIRL }\\ \hline \end{array}$$

And, if you want to analyze, here is a CSV version:

EEEEE Words™,Not EEEEE Words™
ATWIST,ATWIRL
BISTRO,CAFE
CHAI,LATTE
CODEX,MANUSCRIPT
CON,PRO
ESTRUS,HEAT
FEINTS,STABS
GOTCHA,SNAFU
INDEX,UNINDEXED
JEWISH,GENTILE
MOCHA,FRAPPE
NINTH,SIXTH
QUAINT,CHARMING
RECONS,SORTIES
SCONES,TARTS
SWISH,TWIRL


The puzzle satisfies the series' inbuilt assumption, that each word can be tested for whether it is an EEEEE Word™ without relying on the other words.
These are not the only examples of EEEEE Words™; many more exist.

What is the special rule these words conform to?

An EEEEE word is one that

contains one of STR, CON DEX, INT, WIS, CHA as a substring, and is at most 6 letters long.

This is of course

a reference to Dungeons and Dragons, whose players have attributes with those (abbreviated) names. The latest version of that game is the Fifth Edition, which I think is often written as "5E"; hence EEEEE in the title.

So, why

the artificial-looking restriction to length <= 6? It turns out after some discussion with Rubio in TSL that the conceit is that each word corresponds to one of the three 6-sided dice rolled to generate a player character's attributes. In the given list there are three words for each attribute, so this player's character has STR of 6+6+6=18 (three 6-letter words), INT of 6+5+6=17, and so on. Obviously, none of this is part of the actual rule; it merely explains why the rule is what it is.

The simpler version of the rule

without that restriction, of course, is refuted by the examples of UNINDEXED and CHARMING.

Thanks to John Clifford for pointing out in comments

that all the EEEEE words are rather short

and to Rubio for some clarification in TSL.

• You've definitely identified the source of the puzzle name and the basic idea of the rule, but those two misclassified ones have got me stuck too. – John Clifford Jun 20 '17 at 12:40
• I just confirmed against the other editions and the stats are the same across the editions. – n_plum Jun 20 '17 at 12:40
• I don't know if it helps at all but the two we're trying to figure out are also the longest strings in the list with the exception of manuscript; none of the EEEEE words are longer than 6 characters. – John Clifford Jun 20 '17 at 12:42
• True. (Which does provide an explanation that fits everything, though I don't like it.) – Gareth McCaughan Jun 20 '17 at 12:43
• Come to think of it, if you look at how many 6-character EEEEE words there are, it doesn't seem like a ludicrous idea to suggest that the presence of charming and unindexed are there precisely to point out that character count can prevent a word from meeting the requirement. – John Clifford Jun 20 '17 at 12:44