By contrast, the previous PCFG approach requires a finite MR language and its grammar grows intractably large for even moderately complex MR languages.
we utilize the hierarchical subgraph relationships between the MRs in the learned semantic lexicon to produce a smaller, more focused set of PCFG rules.