public static void outputSpans(Tree tree) { log.info(tree.getSpan() + " "); for (Tree child : tree.children()) { outputSpans(child); } }
/** * Collect all the possible targets for traces. This is limited to NP-style traces. * * @param root The tree to search in. This is a recursive function. * @return The set of trace targets. The key is the id of the trace, the value is the span of the target of the trace. */ private static Map<Integer, Span> findTraceTargets(Tree root) { Map<Integer, Span> spansInTree = new HashMap<>(4); Matcher m = TRACE_TARGET_PATTERN.matcher(root.label().value() == null ? "NULL" : root.label().value()); if (m.matches()) { int index = Integer.parseInt(m.group(2)); spansInTree.put(index, Span.fromPair(root.getSpan()).toExclusive()); } for (Tree child : root.children()) { spansInTree.putAll(findTraceTargets(child)); } return spansInTree; }
IntPair span = ctree.getSpan(); if (span != null) { treeSpanMap.put(Pair.makePair(span.getSource(), span.getTarget()), ctree);
IntPair span = ctree.getSpan(); if (span != null) { treeSpanMap.put(Pair.makePair(span.getSource(), span.getTarget()), ctree);
for(Tree subTree : t2) { if(subTree.isPhrasal()) { IntPair span = subTree.getSpan(); Constituent c = cf.newConstituent(span.getSource(), span.getTarget(), subTree.label(), 0.0); if(t1Labels.contains(c)) {
childVec = concatenateContextWords(childVec, tree.getSpan(), words);
mentionTokenLengthCounter.incrementCount(length); IntPair span = t.getSpan(); if (span != null) { if (span.getSource() == tokenStart && span.getTarget() == tokenEnd - 1) { logger.warning("No span for " + t); IntPair nptSpan = npt.getSpan(); if (nptSpan.getSource() == tokenStart && nptSpan.getTarget() == tokenEnd - 1) { nonPretermSpanMatches++;
/** * Create a ParseTree proto from a Tree. If the Tree is a scored tree, the scores will * be preserved. * @param parseTree The parse tree to convert. * @return A protocol buffer message corresponding to this tree. */ public CoreNLPProtos.ParseTree toProto(Tree parseTree) { CoreNLPProtos.ParseTree.Builder builder = CoreNLPProtos.ParseTree.newBuilder(); // Required fields for (Tree child : parseTree.children()) { builder.addChild(toProto(child)); } // Optional fields IntPair span = parseTree.getSpan(); if (span != null) { builder.setYieldBeginIndex(span.getSource()); builder.setYieldEndIndex(span.getTarget()); } if (parseTree.label() != null) { builder.setValue(parseTree.label().value()); } if (!Double.isNaN(parseTree.score())) { builder.setScore(parseTree.score()); } Integer sentiment; if (parseTree.label() instanceof CoreMap && (sentiment = ((CoreMap) parseTree.label()).get(RNNCoreAnnotations.PredictedClass.class)) != null) { builder.setSentiment(CoreNLPProtos.Sentiment.forNumber(sentiment)); } // Return return builder.build(); }
SimpleMatrix childrenVector = NeuralUtils.concatenateWithBias(leftVector, rightVector); if (op.trainOptions.useContextWords) { childrenVector = concatenateContextWords(childrenVector, tree.getSpan(), words); SimpleMatrix childVectorWithBias = NeuralUtils.concatenateWithBias(childVector); if (op.trainOptions.useContextWords) { childVectorWithBias = concatenateContextWords(childVectorWithBias, tree.getSpan(), words);
mentionTokenLengthCounter.incrementCount(length); IntPair span = t.getSpan(); if (span != null) { if (span.getSource() == tokenStart && span.getTarget() == tokenEnd - 1) { logger.warning("No span for " + t); IntPair nptSpan = npt.getSpan(); if (nptSpan.getSource() == tokenStart && nptSpan.getTarget() == tokenEnd - 1) { nonPretermSpanMatches++;
public static void outputSpans(Tree tree) { System.err.print(tree.getSpan() + " "); for (Tree child : tree.children()) { outputSpans(child); } }
public static void outputSpans(Tree tree) { log.info(tree.getSpan() + " "); for (Tree child : tree.children()) { outputSpans(child); } }
public static void outputSpans(Tree tree) { log.info(tree.getSpan() + " "); for (Tree child : tree.children()) { outputSpans(child); } }
for(Tree subTree : t2) { if(subTree.isPhrasal()) { IntPair span = subTree.getSpan(); Constituent c = cf.newConstituent(span.getSource(), span.getTarget(), subTree.label(), 0.0); if(t1Labels.contains(c)) {
childVec = concatenateContextWords(childVec, tree.getSpan(), words);
/** * Create a ParseTree proto from a Tree. If the Tree is a scored tree, the scores will * be preserved. * @param parseTree The parse tree to convert. * @return A protocol buffer message corresponding to this tree. */ public CoreNLPProtos.ParseTree toProto(Tree parseTree) { CoreNLPProtos.ParseTree.Builder builder = CoreNLPProtos.ParseTree.newBuilder(); // Required fields for (Tree child : parseTree.children()) { builder.addChild(toProto(child)); } // Optional fields IntPair span = parseTree.getSpan(); if (span != null) { builder.setYieldBeginIndex(span.getSource()); builder.setYieldEndIndex(span.getTarget()); } if (parseTree.label() != null) { builder.setValue(parseTree.label().value()); } if (!Double.isNaN(parseTree.score())) { builder.setScore(parseTree.score()); } Integer sentiment; if (parseTree.label() instanceof CoreMap && (sentiment = ((CoreMap) parseTree.label()).get(RNNCoreAnnotations.PredictedClass.class)) != null) { builder.setSentiment(CoreNLPProtos.Sentiment.forNumber(sentiment)); } // Return return builder.build(); }