Since the consistency tags emerge, we index the graph and tree vector representation using three indices for convenience.
g g g(i, j, t) denotes whether there is an edge from word w i to word w j with tag t in graph g. The joint decoding problem can be written as a constrained optimization problem as where g g g k = t2g(g g g k )(k = 1, 2, 3).