Merge on workspaces as Hopf algebra Markov chain
Matilde Marcolli, David Skigin

TL;DR
This paper models the process of syntactic structure formation using a Hopf algebra Markov chain, revealing how different Merge operations influence convergence to tree structures and proposing entropy-based optimization for linguistic consistency.
Contribution
It introduces a novel Markov chain model based on Hopf algebra to analyze syntactic Merge operations and their asymptotic behavior in linguistic structure formation.
Findings
External and Internal Merge dynamics analyzed mathematically.
Cost functions alone do not ensure convergence to trees.
Entropy optimization achieves expected structural convergence.
Abstract
We study the dynamical properties of a Hopf algebra Markov chain with state space the binary rooted forests with labelled leaves. This Markovian dynamical system describes the core computational process of structure formation and transformation in syntax via the Merge operation, according to Chomsky's Minimalism model of generative linguistics. The dynamics decomposes into an ergodic dynamical system with uniform stationary distribution, given by the action of Internal Merge, while the contributions of External Merge and (a minimal form of) Sideward Merge reduce to a simpler Markov chain with state space the set of partitions and with combinatorial weights. The Sideward Merge part of the dynamics prevents convergence to fully formed connected structures (trees), unless the different forms of Merge are weighted by a cost function, as predicted by linguistic theory. Results on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Advanced Combinatorial Mathematics · semigroups and automata theory
