Abstract
In this article, we identify Strict Locality as a strong computational property of a certain class of phonological maps from underlying to surface forms. We show that these maps can be modeled with Input Strictly Local functions, a previously undefined class of subregular relations. These functions extend the conception of locality from the Strictly Local formal languages (recognizers/acceptors) (McNaughton and Papert 1971, Rogers and Pullum 2011, Rogers et al. 2013) to maps (transducers/functions) and therefore formalize the notion of phonological locality. We discuss the insights such computational properties provide for phonological theory, typology, and learning.
| Original language | English |
|---|---|
| Pages (from-to) | 23-60 |
| Number of pages | 38 |
| Journal | Linguistic Inquiry |
| Volume | 49 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 2018 |
Keywords
- Computational properties
- Learning
- Locality
- Phonological maps
- Typology
Fingerprint
Dive into the research topics of 'Strict locality and phonological maps'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver