... setof simple, deterministic symbol refinements be-yond parent annotation. We included ten of theirsimplest annotation features, namely: UNARY-DT,UNARY-RB, SPLIT-IN, SPLIT-AUX, SPLIT-CC, SPLIT-%,GAPPED-S, ... Representation of Implicit Grammars2.1 All-Fragments GrammarsWe consider an all-fragments grammar G (seeFigure 1(a)) derived from a binarized treebankB. G is formally a tree-substitution grammar (Resnik, ... data-oriented parsing and tree-substitution grammar learning. We re-quire only simple, deterministic grammar symbol refinement, in contrast to recentwork on latent symbol refinement. More-over,...