De-spite the existence of denser annotation schemes (e.g., ), the TLINK annotation task is quadratic in the number of nodes, and it is practically infeasible to annotate complete graphs.
the problem of identifying these unknown relations in training and test is a major issue that dramatically hurts existing methods.