Analyzing Etruscan Language Origins Using Persistent Homology
Overview
Language data is often difficult to analyze because of its high-dimensional nature, which causes an exponential growth of the size of the space in which the data lives as the dimension increases. This, coupled with sparsity of data (texts) from which to draw, has presented long-term challenges in comparing ancient languages concretely and holistically. This study analyzes a framework for overcoming this barrier through a quantitative method, topological data analysis (TDA), while also applying it to ongoing investigations of the isolate ancient Etruscan in an effort to understand its much-debated origin. TDA provides higher-level information about the inherent structure of a language’s phonology, and with the aid of one of its tools, persistent homology, one can compare different phonologies to determine which languages are most closely related. Results indicate that TDA successfully detects patterns unique to language data and is able to provide a greater distinguishability between languages than other methods. Comparing Etruscan to both Indo-European and other languages suggests that it may have been a relative of the Sanskrit or Semitic languages, explaining its singularity compared to the neighboring Latin and Greek.
Competition history
- AJAS 2026
Related projects
ISEF · 2025
Analyzing Pre-Indo-European Theory of the Etruscan Language Origins Using Topological Data Analysis
ISEF · 2024
The Effect of Absence of Select Languages on Amount of Divergence in Reconstruction of Proto-Romance
ISEF · 2016
Cosheaf Theoretical Constructions in Networks and Persistent Homology
ISEF · 2018
Generalized Persistence Parameters for Analyzing Stratified Pseudomanifolds
ISEF · 2021
Uncovering of Aged Sanskrit/Devanagari Documents Utilizing Generative Adversarial Networks and Tomography to Multidimensionally Reconstruct Missing Elements
CSEF · 2010
Linguistic Creativity and the Zipfian Distribution: An Entropic, Stylometric, and Computational Analysis
CSEF · 2013
The Automated Creation of Randomized Relational Languages as a Web Application
ISEF · 2021
A Novel and Efficient Method of Persistent Homology to Detect and Remove Topological Errors in Triangle Mesh Data
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: AAAS Annual Meeting (Confex) / American Junior Academy of Science