Thomas Graf, Stony Brook University, will present “Subregular linguistics for linguists” in the Linguistics colloquium series at 3:30 Friday Nov 8. An abstract follows. All are welcome!
Drawing from computational work that is known as the subregular program, I will argue against two received views in linguistics: “phonology and syntax are very different’ and “subcategorization is a solved problem”.
- Cognitive parallelism
Subregular notions of complexity can be applied to strings as well as trees. Doing so reveals that phonology and syntax are remarkably similar (and those parallels even extend into morphology and semantics). For instance, islands and blocking effects are instances of the same computational mechanism.
Subcategorization (or c-selection) is rarely studied by linguists, but it is actually a source of tremendous overgeneration. Once again subregular notions of complexity can be used to address this problem. This isn’t just a mathematical exercise, but makes concrete empirical predictions about the nature of category systems, subcategorization, the status of empty heads, the DP-analysis, DM-style roots, and once again highlights parallels to phonology.
The general upshot is that subregular concepts, despite their computational origin, are intuitive and linguistically fertile: they address conceptual issues, bridge gaps between linguistic subfields, and make concrete empirical predictions. Subregular linguistics is just linguistics with some computational flavor sprinkled on top.
Disclaimer: This talk is 100% formula-free.