2018
DOI: 10.1007/978-3-662-57784-4_4
|View full text |Cite
|
Sign up to set email alerts
|

A Challenge for Tier-Based Strict Locality from Uyghur Backness Harmony

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
4
1

Relationship

2
7

Authors

Journals

citations
Cited by 16 publications
(17 citation statements)
references
References 25 publications
0
16
0
Order By: Relevance
“…2018; Mayer and Major, 2018;Graf and Mayer, 2018) to the case of subregular functions. There, tier projections are formalized as functions that delete certain symbols of their inputs.…”
Section: Formmentioning
confidence: 99%
See 1 more Smart Citation
“…2018; Mayer and Major, 2018;Graf and Mayer, 2018) to the case of subregular functions. There, tier projections are formalized as functions that delete certain symbols of their inputs.…”
Section: Formmentioning
confidence: 99%
“…The treatment of unbounded stress (Baek, 2018), Uyghur backness harmony (Mayer and Major, 2018), and Sanskrit n-retroflexion (Graf and Mayer, 2018) in subregular phonology has given rise to a rich collection of extensions of the tierbased strictly local languages (TSL; Heinz et al, 2011) as formal descriptions of the typology of phonotactic dependencies. These language classes formalize the notion of local dependencies defined on tiers.…”
Section: Introductionmentioning
confidence: 99%
“…This shows that IO-TSL is indeed a generalization of TSL. In fact, I-TSL and O-TSL have been independently proposed in computational phonology (Baek, 2017;De Santo and Graf, 2017;Mayer and Major, 2018;Yang, 2018), and Graf and Mayer (2018) show that the combination of the two into IO-TSL furnishes the additional power that is required for Sanskrit n-retroflexion. Under the assumption that dependencies in phonology and syntax are of comparable complexity, IO-TSL is a natural candidate for a tighter upper bound on the complexity of constraints on c-strings.…”
Section: Defining Io-tslmentioning
confidence: 99%
“…Such functions are "local" in the sense that the action performed on each input symbol depends only on information about symbols in the input and output streams within a bounded distance. In this paper, we augment strictly local functions with tier projection, a mechanism introduced by Heinz et al (2011) and elaborated by Baek (2018), Mayer and Major (2018), and Graf and Mayer (2018) that allows the locality constraint to bypass irrelevant alphabet symbols, extending the distance over which dependencies may be enforced.…”
Section: Introductionmentioning
confidence: 99%