Syntactic Learning over Tree Tiers
Logics · 06.05.2026 · 4 (2) · 5
DOI: 10.3390/logics4020005 ↗Kurz gefasst
Fachartikel in der Zeitschrift Logics, online erschienen am 06.05.2026. Verfasst von Logan Swanson. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. National Science Foundation.
Abstract (Originalsprache)
The class of tier-based strictly 2-local (TSL2) languages has been shown to be useful in modeling patterns across different linguistic domains. This paper discusses the learnability of the intersection closure of the TSL2 languages, multi-TSL2 (MTSL2). I present two learning algorithms, one that learns a relevant subclass of MTSL in polynomial time, and one that learns MTSL proper but requires potentially exponential time. Both algorithms generalize across tree-based and string-based data representations. I show that each algorithm correctly learns its target class from a limited sample of positive data, and discuss the tradeoffs between the two. The success of these algorithms delivers a key learning result for subregular linguistics, and demonstrates the utility of subregular language classes in developing a unified learning theory that spans different linguistic domains.
Förderung
- U.S. National Science Foundation
Zitieren
APA
Swanson, L. (2026). Syntactic Learning over Tree Tiers. Logics, 4(2), 5. https://doi.org/10.3390/logics4020005
Vancouver
Swanson L. Syntactic Learning over Tree Tiers. Logics. 2026;4(2):5. doi:10.3390/logics4020005
BibTeX
@article{Swanson2026,
author = {Swanson, Logan},
title = {Syntactic Learning over Tree Tiers},
journal = {Logics},
year = {2026},
volume = {4},
number = {2},
pages = {5},
doi = {10.3390/logics4020005}
}
EUVIMED