Asset Details
Do you wish to reserve the book?
A Quantifier-Based Approach to NPI-Licensing Typology: Empirical and Computational Investigations
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Quantifier-Based Approach to NPI-Licensing Typology: Empirical and Computational Investigations
Do you wish to request the book?
A Quantifier-Based Approach to NPI-Licensing Typology: Empirical and Computational Investigations
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Dissertation
A Quantifier-Based Approach to NPI-Licensing Typology: Empirical and Computational Investigations
2020
Overview
This thesis examines the quantifier-based approach to NPI-licensing (as proposed in (Giannakidou, 2000)) from empirical and computational perspectives. This approach argues that all NPIs can be categorized as either existentially or universally quantified items, and that this difference drives cross-linguistically divergent NPI-behaviors. After providing the necessary background and assumptions, in the first half of the thesis I show that English any-NPIs are existentially quantified, whereas Hungarian se-NPIs are universally quantified. I also demonstrate how this approach can help understand the behavior of NPIs in other languages and language families such as Slavic, Mandarin Chinese, Turkish, and Romance languages. In the second half of the thesis, I analyze the quantifier-based NPI-licensing constraints for computational complexity. I find that except for the constraints that rely on derived c-command, all other constraints can be described with Input-local Tier-based Strictly Local (I-TSL) or Multiple Input-local Tier-based Strictly Local (MITSL) restrictions, which means that tree-languages that satisfy NPI-licensing constraints for the most part fit into a fairly restrictive subregular class of tree-languages. Taken together, this thesis argues that a theoretically informed approach to linguistic phenomena can significantly affect results on their computational complexity.
