Open
Description
Find an "ideal" generator by beginning with a beam search, then iteratively & greedily applying the best expansion of a given graph grammar on the current generator, keeping the generator probabilistically normalized & doing one round of EM to optimize the probabilities for each possible graphgram rule application.