2016
DOI: 10.25151/nkje.2016.58.3.009
|View full text |Cite
|
Sign up to set email alerts
|

Relative Clauses and Labeling Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
0
0
Order By: Relevance
“…In what follows, we discuss these consequences of the Spell-Out operation as applied to aPs. The interaction between Spell-Out domains and labeling has been worked out in previous research (Kiyang and Wonbin 2016;Takita et al 2016;Gallego 2018). The crucial assumption we make here is that when a constituent α is Spelled-Out, it is eliminated from syntactic representation (Ott 2011), becoming inaccessible for labeling purposes.…”
Section: When Ap Is Spelled-outmentioning
confidence: 99%
“…In what follows, we discuss these consequences of the Spell-Out operation as applied to aPs. The interaction between Spell-Out domains and labeling has been worked out in previous research (Kiyang and Wonbin 2016;Takita et al 2016;Gallego 2018). The crucial assumption we make here is that when a constituent α is Spelled-Out, it is eliminated from syntactic representation (Ott 2011), becoming inaccessible for labeling purposes.…”
Section: When Ap Is Spelled-outmentioning
confidence: 99%