We take inspiration from unsupervised grammar induction (UGI) techniques originally proposed for natural language.
we use them to investigate if the languages that emerge in the typical setup of referential games exhibit interesting syntactic structure, and to what extent this depends on the maximum message length and number of symbols that the agents are allowed to use.