Paper

On the Spectra of Syntactic Structures

---

Abstract

This paper explores the application of spectral graph theory to the problem of characterizing linguistically significant classes of tree structures. As a case study, we focus on three classes of trees, binary, X-bar, and asymmetric c-command extensional, and show that the spectral properties of different matrix representations of these classes of trees provide insight into the properties that characterize these classes. More generally, our goal is to provide another route to understanding the structure of natural language, one that does not come from extensive definitions and rules taken by extrapolating from the syntactic structure, but instead is extracted directly from computation on the syntactically-defined graphical structures.

Keywords: mathematical linguistics, spectral graph theory, syntax

How to Cite:

Senturia, I. & Frank, R., (2023) “On the Spectra of Syntactic Structures”, Society for Computation in Linguistics 6(1), 199-211. doi: https://doi.org/10.7275/b65f-p440