CANDS: A Computational Implementation of Collins and Stabler (2016)
- Satoru Ozaki (University of Massachusetts Amherst)
- Yohei Oseki (The University of Tokyo)
Abstract
Syntacticians must keep track of the empirical coverages and the inner workings of syntactic theories, a task especially demanding for minimalist syntacticians to perform manually and mentally. We believe that the computational implementation of syntactic theories is desirable in that it not only (a) facilitates the evaluation of their empirical coverages, but also (b) forces syntacticians to specify their inner workings. In this paper, we present CANDS, a computational implementation of Collins AND Stabler (2016) in the programming language Rust. Specifically, CANDS consists of one main library, cands, as well as two wrapper programs for cands, derivck and derivexp. The main library, cands, implements key definitions of fundamental concepts in minimalist syntax from Collins and Stabler (2016), which can be employed to evaluate and extend specific syntactic theories. The wrapper programs, derivck and derivexp, allow syntacticians to check and explore syntactic derivations through an accessible interface.
Keywords: syntax, computational linguistics, evaluation, extension, Rust
How to Cite:
Ozaki, S. & Oseki, Y., (2023) “CANDS: A Computational Implementation of Collins and Stabler (2016)”, Society for Computation in Linguistics 6(1), 47-68. doi: https://doi.org/10.7275/908h-3s86
Downloads:
Download PDF