arXiv:1902.07516 [cond-mat.dis-nn]AbstractReferencesReviewsResources
Emergence of order in random languages
Published 2019-02-20Version 1
We consider languages generated by weighted context-free grammars. It is shown that the behaviour of large texts is controlled by saddle-point equations for an appropriate generating function. We then consider ensembles of grammars, in particular the Random Language Model of E. DeGiuli, Phys. Rev. Lett., 2019. This model is solved in the replica-symmetric ansatz, which is valid in the high-temperature, disordered phase. It is shown that in the phase in which languages carry information, the replica symmetry must be broken.
Comments: 14 pages + 1 appendix. Comments welcome
Related articles:
arXiv:1809.01201 [cond-mat.dis-nn] (Published 2018-09-04)
Random Language Model: a path to principled complexity
arXiv:2309.14913 [cond-mat.dis-nn] (Published 2023-09-26)
Robustness of the Random Language Model
arXiv:2105.00832 [cond-mat.dis-nn] (Published 2021-05-03)
Absence of Phase Transition in Random Language Model