Suppose we have a random variable which takes non-numeric values a,b,c and want to quantify how empirical distribution of $n$ samples of this variable deviates from true distribution. The following inequality (from Cover & Thomas) applies in this case.
Theorem 12.4.1 (Sanov's theorem): Let $X_1, X_2, \ldots, X_n$ be i.i.d. $\sim Q(x)$.
Let $E \subseteq \mathscr{P}$ be a set of probability distributions. Then $$Q^n(E) = Q^n(E \cap \mathscr{P}_n) \leq (n+1)^{|\mathcal{X}|}2^{-nD(P^*||Q)},$$ where $$P^* = \arg\min_{P \in E} D(P||Q),$$ is the distribution in $E$ that is closest to $Q$ in relative entropy.
This inequality is quite loose for small $n$. For binary outcomes, $|\mathcal{X}|=2$, and Chernoff-Hoeffding bound is much tighter.
Is there a similarly tight bound for for $|\mathcal{X}|=3$?