Implementation of Multiple Wh-movements in Computational Minimalism

Implementation of Multiple Wh-movements in Computational Minimalism

This paper tries to provide computational algorithms for multiple wh-movements in English. Multiple wh-movements have been one of the interesting topics in syntactic theories, and they can also be handled in Chomsky's Minimalist syntax. For computational implementations, this paper modifies Stabler's Computational Minimalism, and develops a Revised Computational Minimalism system (RCM). In this RCM system, Chomsky's Probe-Goal relations are applied and wh-movements are computationally implemented with wh-feature instantiation and its matching processes. In order to handle multiple features, we will adopt Chomsky's local merge, and multiple wh-movements will be implemented by multiple feature matching. In sum, this paper develops the algorithms by which we can computationally implement multiple wh-movements in Minimalist syntax.