public void reInit() { initPrimitives(); l_branches.clear(); l_states.clear(); for (List<DEPHead> list : l_2ndHeads) list.clear(); Arrays.fill(n_2ndPos, 0); s_reduce.clear(); d_tree.clearHeads(); }
public void reInit() { initPrimitives(); l_branches.clear(); l_states.clear(); for (List<DEPHead> list : l_2ndHeads) list.clear(); Arrays.fill(n_2ndPos, 0); s_reduce.clear(); d_tree.clearHeads(); }
public void reInit() { initPrimitives(); l_branches.clear(); l_states.clear(); for (List<DEPHead> list : l_2ndHeads) list.clear(); Arrays.fill(n_2ndPos, 0); s_reduce.clear(); d_tree.clearHeads(); }
public void reInit() { initPrimitives(); l_branches.clear(); l_states.clear(); for (List<DEPHead> list : l_2ndHeads) list.clear(); Arrays.fill(n_2ndPos, 0); s_reduce.clear(); d_tree.clearHeads(); }
public DEPNode moveToNextPredicate() { DEPNode pred = d_tree.getNextPredicate(i_pred); if (pred != null) { i_pred = pred.id; d_lca = pred; l_argns.clear(); m_argns.clear(); s_skip.clear(); s_skip.add(i_pred); s_skip.add(DEPLib.ROOT_ID); } return pred; }
public DEPNode moveToNextPredicate() { DEPNode pred = d_tree.getNextPredicate(i_pred); if (pred != null) { i_pred = pred.id; d_lca = pred; l_argns.clear(); m_argns.clear(); s_skip.clear(); s_skip.add(i_pred); s_skip.add(DEPLib.ROOT_ID); } return pred; }
private void getPredicateIds(CTTree tree, IntOpenHashSet[] sets) { for (IntOpenHashSet set : sets) set.clear(); int idx; for (CTNode node : tree.getTokens()) { idx = isVerbPredicate(tree, node); if (idx >= 0) sets[idx].add(node.getTerminalId()); } }
private void label() { DEPNode pred; while (i_pred < t_size) { pred = d_tree.get(i_pred); p_roleset = getRoleset(); s_skip.clear(); s_skip.add(i_pred); s_skip.add(DEPLib.ROOT_ID); l_argns.clear(); m_argns.clear(); d_lca = pred; do { labelAux(pred, d_lca); d_lca = d_lca.getHead(); } while (d_lca != null);// && (pred.isDependentOf(d_lca) || s_up.contains(getDUPath(d_lca, pred)))); i_pred = getNextPredId(i_pred); } }