An Information-Theoretic Approach to Identifying Formulaic Clusters in Textual Data
Mirrored from arXiv — NLP / Computation & Language for archival readability. Support the source by reading on the original site.
Computer Science > Computation and Language
Title:An Information-Theoretic Approach to Identifying Formulaic Clusters in Textual Data
Abstract:Texts, whether literary or historical, exhibit structural and stylistic patterns shaped by their purpose, authorship, and cultural context. Formulaic texts, which are characterized by repetition and constrained expression, tend to differ in their \textit{information content} (as defined by Shannon) compared to more dynamic compositions. Identifying such patterns in historical documents, particularly multi-author texts like the Hebrew Bible, provides insights into their origins, purpose, and transmission. This study aims to identify formulaic clusters: sections exhibiting systematic repetition and structural constraints, by analyzing recurring phrases, syntactic structures, and stylistic markers. However, distinguishing formulaic from non-formulaic elements in an unsupervised manner poses a computational challenge, especially in high-dimensional, sample-poor data sets where patterns must be inferred without predefined labels.
To address this, we develop an information-theoretic algorithm that uses weighted \textit{self-information} distributions to recover structured partitions in text. The resulting clusters are interpreted from their self-information profiles and characteristic recurring features. By extending classical discrete self-information measures to a continuous formulation based on differential self-information in multivariate Gaussian distributions, our method remains applicable across various textual representations, including neural embeddings under Gaussian priors.
Applied to hypothesized authorial divisions in the Hebrew Bible, our approach isolates stylistic layers and provides a quantitative framework for textual stratification. This method enhances our ability to analyze compositional patterns, offering deeper insights into the literary and cultural evolution of texts shaped by complex authorship and editorial processes.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2503.07303 [cs.CL] |
| (or arXiv:2503.07303v3 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2503.07303
arXiv-issued DOI via DataCite
|
|
| Related DOI: | https://doi.org/10.1017/chr.2025.10011
DOI(s) linking to related resources
|
Submission history
From: Gideon Yoffe [view email][v1] Mon, 10 Mar 2025 13:24:46 UTC (5,802 KB)
[v2] Sun, 17 Aug 2025 08:31:45 UTC (6,122 KB)
[v3] Tue, 28 Jul 2026 17:47:45 UTC (1,733 KB)
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — NLP / Computation & Language
-
Geometric and Behavioral Stratification in Transformer Residual Streams
Aug 14
-
Perturbation-based Regional Interpretability through Subtraction Mapping (PRISM): naming-error dissociations in language models and post-stroke aphasia
Aug 14
-
I-SDPO: Instance-Level Adaptive Self-Distillation Policy Optimization
Aug 14
-
Comment on "Modeling rapid language learning by distilling Bayesian priors into artificial neural networks"
Aug 14
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.