Based on such considerations, we devised the following scheme for scoring templates: where in(t) is the in-degree of node t, defined as the sum of edge weights coming into t; out(t) is the outdegree of node t, defined similarly.
a template receives a high score if it is "used" by many frequent wishes but does not match many frequent content-only wishes.