We run the parser on all sentences, and we note for which sentences the parser is successful.
we define the parsability of a word R(w) as the ratio of the number of times the word occurs in a sentence with a successful parse (C(w|OK)) and the total number of sentences that this word occurs in (C(w)): if a word only occurs in sentences that cannot be parsed successfully, the parsability of that word is 0.