Abstract

Kiparsky 1973b proposes a number of constraints on global rules. All his examples are of the type where derived strings become separated, in terms of their behavior, from otherwise identical underlying strings. This paper will argue for cases of global rules that do not meet Kiparsky's conditions. In fact, the two cases discussed violate Kiparsky's conditions by applying to underlying rather than derived strings. The inescapable conclusion is that Kiparsky's constraints are not valid for grammars.*

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.