In this paper I introduced three of the central constraints of the learnability proof of Wexler and Culicover (1980). The question arose as to how we might handle in other ways the data that the Raising Principle accounts for. While a processing account appears plausible, it appears that at least one promising analysis of that sort does not work. In section 3 I suggested that processing explanations for data accounted for by another learnability constraint, the Freezing Principle, are not as straightforward as might have been supposed.