Given a dependency parse tree, any sub-tree can be a candidate template, setting some of its nodes as variables (Sudo et al., 2003).
the number of possible templates is exponential in the size of the sentence.