In this paper, we study the famous Erdős--Sós forbidden intersection problem for words over an alphabet of size $m$: what is the maximal size of a subfamily $\mathcal{F}$ of $[m]^n$ that does not contain two vectors $x, y$ coinciding on exactly $t - 1$ coordinates? We answer this question provided $m \ge \operatorname{poly}(t)$ and $n \ge \operatorname{poly}(t)$ for some polynomial function $\operatorname{poly}(\cdot)$ of $t$, greatly extending the recent result of Keevash, Lifshitz, Long and Minzer. Our proof combines some of the recently developed methods in extremal combinatorics, including the spread approximation technique of Kupavskii and Zakharov and the hypercontractivity approach developed in a series of works by Keevash, Keller, Lifshitz, Long, Marcus and Minzer.