public void saveTrees(Collection<Tree> trees1, double weight1, Collection<Tree> trees2, double weight2) { trainSize = 0.0; int treeCount = 0; trees.clear(); treeWeights.clear(); for (Tree tree : trees1) { trees.add(tree); treeWeights.incrementCount(tree, weight1); trainSize += weight1; } treeCount += trees1.size(); if (trees2 != null && weight2 >= 0.0) { for (Tree tree : trees2) { trees.add(tree); treeWeights.incrementCount(tree, weight2); trainSize += weight2; } treeCount += trees2.size(); } log.info("Found " + treeCount + " trees with total weight " + trainSize); }
/** * Retains the minimal set of top keys such that their count sum is more than thresholdCount. * @param counter * @param thresholdCount */ public static<E> void retainTopMass(Counter<E> counter, double thresholdCount){ PriorityQueue<E> queue = Counters.toPriorityQueue(counter); counter.clear(); double mass = 0; while (mass < thresholdCount && !queue.isEmpty()) { double value = queue.getPriority(); E key = queue.removeFirst(); counter.setCount(key, value); mass += value; } }
public edu.stanford.nlp.classify.Classifier learnClassifier(String label, boolean forLearningPatterns, TwoDimensionalCounter<CandidatePhrase, E> wordsPatExtracted, Counter<E> allSelectedPatterns) throws IOException, ClassNotFoundException { phraseScoresRaw.clear(); learnedScores.clear();
scoreForAllWordsThisIteration.clear(); Counters.addInPlace(scoreForAllWordsThisIteration, phraseScores);
public void saveTrees(Collection<Tree> trees1, double weight1, Collection<Tree> trees2, double weight2) { trainSize = 0.0; int treeCount = 0; trees.clear(); treeWeights.clear(); for (Tree tree : trees1) { trees.add(tree); treeWeights.incrementCount(tree, weight1); trainSize += weight1; } treeCount += trees1.size(); if (trees2 != null && weight2 >= 0.0) { for (Tree tree : trees2) { trees.add(tree); treeWeights.incrementCount(tree, weight2); trainSize += weight2; } treeCount += trees2.size(); } System.err.println("Found " + treeCount + " trees with total weight " + trainSize); }
public void saveTrees(Collection<Tree> trees1, double weight1, Collection<Tree> trees2, double weight2) { trainSize = 0.0; int treeCount = 0; trees.clear(); treeWeights.clear(); for (Tree tree : trees1) { trees.add(tree); treeWeights.incrementCount(tree, weight1); trainSize += weight1; } treeCount += trees1.size(); if (trees2 != null && weight2 >= 0.0) { for (Tree tree : trees2) { trees.add(tree); treeWeights.incrementCount(tree, weight2); trainSize += weight2; } treeCount += trees2.size(); } log.info("Found " + treeCount + " trees with total weight " + trainSize); }
public void saveTrees(Collection<Tree> trees1, double weight1, Collection<Tree> trees2, double weight2) { trainSize = 0.0; int treeCount = 0; trees.clear(); treeWeights.clear(); for (Tree tree : trees1) { trees.add(tree); treeWeights.incrementCount(tree, weight1); trainSize += weight1; } treeCount += trees1.size(); if (trees2 != null && weight2 >= 0.0) { for (Tree tree : trees2) { trees.add(tree); treeWeights.incrementCount(tree, weight2); trainSize += weight2; } treeCount += trees2.size(); } log.info("Found " + treeCount + " trees with total weight " + trainSize); }
/** * Retains the minimal set of top keys such that their count sum is more than thresholdCount. * @param counter * @param thresholdCount */ public static<E> void retainTopMass(Counter<E> counter, double thresholdCount){ PriorityQueue<E> queue = Counters.toPriorityQueue(counter); counter.clear(); double mass = 0; while (mass < thresholdCount && !queue.isEmpty()) { double value = queue.getPriority(); E key = queue.removeFirst(); counter.setCount(key, value); mass += value; } }
/** * Retains the minimal set of top keys such that their count sum is more than thresholdCount. * @param counter * @param thresholdCount */ public static<E> void retainTopMass(Counter<E> counter, double thresholdCount){ PriorityQueue<E> queue = Counters.toPriorityQueue(counter); counter.clear(); double mass = 0; while (mass < thresholdCount && !queue.isEmpty()) { double value = queue.getPriority(); E key = queue.removeFirst(); counter.setCount(key, value); mass += value; } }
/** * Retains the minimal set of top keys such that their count sum is more than thresholdCount. * @param counter * @param thresholdCount */ public static<E> void retainTopMass(Counter<E> counter, double thresholdCount){ PriorityQueue<E> queue = Counters.toPriorityQueue(counter); counter.clear(); double mass = 0; while (mass < thresholdCount && !queue.isEmpty()) { double value = queue.getPriority(); E key = queue.removeFirst(); counter.setCount(key, value); mass += value; } }
scoreForAllWordsThisIteration.clear(); Counters.addInPlace(scoreForAllWordsThisIteration, phraseScores);
scoreForAllWordsThisIteration.clear(); Counters.addInPlace(scoreForAllWordsThisIteration, phraseScores);