Why is modeling the joint distribution between many continuous random variables, obtains generalization more easily?

Step 1
If one wants to model the joint distribution of 10 consecutive words in a natural language with a vocabulary V of size 100,000, there are potentially ${100000}^{10}-1={10}^{50}-1$ free parameters
Why is this? Well, to specify the joint distribution of 2 words is a table of $|V{|}^2$ numbers (probabilities of joint appearance). For each new word, you add 1 new dimension to the table. Hence, for a set of n words you need to specify $|V{|}^n$ values, minus 1 (because probability distributions sum to 1). So, ouch! That's a lot.
When modeling continuous variables, we obtain generalization more easily (e.g. with smooth classes of functions like multi-layer neural networks or Gaussian mixture models) because the function to be learned can be expected to have some local smoothness properties.
The thing about discrete distributions is that they can be exceptionally "jagged"; i.e. things can In language, for instance, there is no reason why one word should statistically appear in similar contexts to, say, the one next to it, alphabetically. Hence the explosion of parameters above. Continuous distributions, by assumption, don't have this issue.
Step 2
More concretely, our problem above had $|V{|}^n-<!--\; -\; -->1$ parameters to characterize the joint distribution of n variables, in the discrete case. Let's suppose we have an RV $X_i$ that takes values in ${\mathbb{R}}^d$ rather than V. At first glance, this seems to be harder since the number of possible values in Rd is larger than |V| (even for $d=1$). However, what if we think that the joint distribution of $X=(X_1,\dots <!--\; \dots \; -->,X_n)$ is well approximated by a Gaussian mixture model? Then we need only specify k (number of Gaussians), W (vector of weights, $|W|=k$), the means ${\mathrm{\mu <!--\; \mu \; -->}}_j\in <!--\; \in \; -->{\mathbb{R}}^d$, and the covariances $\mathrm{\sigma <!--\; \sigma \; -->}\in <!--\; \in \; -->{\mathbb{R}}^{d\times <!--\; \times \; -->d}$. This is only on the order of $k+k(nd+n^2{d}^2)$, roughly speaking. This is comparatively quite small! Much of the reason for this is that large patches of space are assumed to have probabilities smoothly varying compared to their neighbors; hence, one requires many fewer parameters to characterize large patches of space. (Even the largest deep neural networks have nowhere near close to $\sim <!--\; \sim \; -->{10}^{50}$ parameters! Hence why we prefer to do NLP in "continuous spaces" by embedding them).