The<cite> Klein and Manning (2003)</cite> parser is an unlexicalized PCFG with various carefully selected context annotations. Their model uses some parent annotations, and marks nodes which initiate or in certain cases conclude unary productions. They also propose linguistically motivated annotations for several tags, including V P , IN , CC,N P and S. This results in a reasonably accurate unlexicalized PCFG parser. The downside of this approach is that their features are very specific, applying different annotations to different treebank nonterminals. For instance, they mark right-recursive N P s and not V P s (i.e., an N P which is the right-most child of another N P ). This is because data sparsity issues preclude annotating the nodes in the treebank too liberally. The goal of our work is to automate the process a bit, by annotating with more general features that apply broadly, and by learning clus-ters of these annotations.