Graph Construction Clause Samples

Graph Construction. ‌ Algorithm 2 shows a pseudo-code for constructing the graph given a depen- dency tree, consisting of syntactic and semantic relations, and coreference Input: D: a dependency tree, Output: G: Graph. foreach node N in D do if N.skip() then continue; else if N.isArgument() then P ← N .getPredicate(); L ← N .getArgumentLabel(); G.addArgument(P , N , L); else if N.isAttribute() then A ← N .getAttributeHead(); L ← N .getAttributeType(); G.addAttribute(A, N , L); H ← N .getSyntacticHead(); L ← N .getSyntacticLabel(); G.addArgument(H, N , L); if C.hasEntityFor(N) then E ← C.getEntityFor(N ) G.addToEntity(E, N );