public boolean isSiblingOf(DEPNode node) { return node.isDependentOf(getHead()); }
private boolean hasNoDependent(DEPNode head, int bIdx, int eIdx) { DEPNode node; int i; for (i=bIdx; i<eIdx; i++) { node = d_tree.get(i); if (node.isDependentOf(head)) return false; } return true; }
private boolean rerankUnique(StringPrediction prediction, DEPLabel label, DEPNode head, Pattern p, int bIdx, int eIdx) { if (p.matcher(label.deprel).find()) { DEPNode node; int i; for (i=bIdx; i<eIdx; i++) { node = d_tree.get(i); if (node.isDependentOf(head) && p.matcher(node.getLabel()).find()) { prediction.score = -1; return true; } } } return false; }
@Override protected void resetPost(DEPNode lambda, DEPNode beta, DEPLabel label) { if (lambda.isDependentOf(beta)) { resetVerbPOSTag(beta, lambda); resetNotHead(lambda); } else if (beta.isDependentOf(lambda)) { resetVerbPOSTag(lambda, beta); } }
private DEPNode getDependent(DEPNode pred, DEPNode node) { if (node.isDependentOf(pred)) return node; else return getDependent(pred, node.getHead()); }
/** Called by {@link LGAsk#generateQuestionFromAsk(DEPTree, String)}. */ private void setRest(DEPTree tree, DEPNode verb, Set<DEPNode> added) { for (DEPNode node : verb.getSubNodeSortedList()) { if (added.contains(node)) continue; else if (node.isDependentOf(verb) && (node.isPos(CTLibEn.POS_TO) || node.isLabel(DEPLibEn.DEP_COMPLM) || node.isLabel(DEPLibEn.DEP_MARK))) continue; else tree.add(node); } }
case 0: return (node.isDependentOf(pred)) ? token.field : null; case 1: return (pred.isDependentOf(node)) ? token.field : null; case 2: return (pred.isDependentOf(d_lca)) ? token.field : null; case 3: return (pred == d_lca) ? token.field : null; case 4: return (node == d_lca) ? token.field : null;
private boolean clearPreviousDependents(DEPNode head) { boolean found = false; DEPNode node; int i; for (i=head.id-1; i>0; i--) { node = d_tree.get(i); if (node.isDependentOf(head)) { node.clearHead(); s_reduce.remove(node.id); found = true; } } return found; } }
@Override public void countAccuracy(int[] counts) { int i, las = 0, uas = 0, ls = 0; StringIntPair p; DEPNode node; for (i=1; i<t_size; i++) { node = d_tree.get(i); p = g_heads[i]; if (node.isDependentOf(d_tree.get(p.i))) { uas++; if (node.isLabel(p.s)) las++; } if (node.isLabel(p.s)) ls++; } counts[0] += t_size - 1; counts[1] += las; counts[2] += uas; counts[3] += ls; }
if (sHead.isDependentOf(gHead)) if (tmp.isDependentOf(gHead)) if (gHead.isDependentOf(cNode))
if (node.isDependentOf(beVerb)) node.setHead(beta);
if (node.isDependentOf(root)) node.setHead(tree.get(0), DEPLibEn.DEP_ROOT);