From the article: > We can formalize the above considerations by giving rules for a toy language L over an alphabet A. In the parlance of theoretical linguist

From the article: > We can formalize the above considerations by giving rules for a toy language L over an alphabet A. In the parlance of theoretical linguistics, our language is generated by a stochastic or probabilistic context-free grammar (PCFG) [41–44]. We will discuss the relationship between our model and a generic PCFG in Section C.