abstract = "Augmented Graph Grammars are a robust rule
representation for rich graph data. In this paper we
present our work on the automatic induction of graph
grammars for argument diagrams via EC. We show that EC
outperforms the existing grammar induction algorithms
gSpan and Subdue on our dataset. We also show that it
is possible to augment the standard EC process to
harvest a set of diverse rules which can be filtered
via a post-hoc Chi-Squared analysis.",