49ca03822497d26a3943d5084ed59130-AuthorFeedback.pdf

Reviewer 4 (R4) asks for "at least an example of a problem in which it would be more useful than other frameworks." Formalism R2 gives an example FGG that appears to generate graphs with arbitrarily high treewidth. We are uncertain how R4's suggestion to draw the external nodes on the left-hand side differs from Renaming We agree with R3 and R4 that Def. 7 should formalize how nodes are renamed when copied. But this wouldn't be as flexible as we'd like; for example, we'd like to query a HMM for the Second, R4 writes that we need node names when matching up nodes during conjunction. But conjunction is an operation on FGGs, not factor graphs, so at the time of conjunction, no renaming has taken place.