Morpheme Induction for Emergent Language

Brendon Boldt, David Mortensen
10/3/2025
cs.CL

No confident code implementation found for this paper.

Abstract

We introduce CSAR, an algorithm for inducing morphemes from emergent language corpora of parallel utterances and meanings. It is a greedy algorithm that (1) weights morphemes based on mutual information between forms and meanings, (2) selects the highest-weighted pair, (3) removes it from the corpus, and (4) repeats the process to induce further morphemes (i.e., Count, Select, Ablate, Repeat). The effectiveness of CSAR is first validated on procedurally generated datasets and compared against baselines for related tasks. Second, we validate CSAR's performance on human language data to show that the algorithm makes reasonable predictions in adjacent domains. Finally, we analyze a handful of emergent languages, quantifying linguistic characteristics like degree of synonymy and polysemy.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{boldt2025morpheme,
  title  = {Morpheme Induction for Emergent Language},
  author = {Brendon Boldt and David Mortensen},
  year   = {2025},
  eprint = {2510.03439},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.03439v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.03439.svg)](https://codeofpaper.com/paper/2510.03439)

Discussion