Examples of score()


Examples of edu.stanford.nlp.stats.MultiClassChunkEvalStats.score()

        classifier.classifyAndWriteAnswers(data, featurizedData, pw,
                                           classifier.makeReaderAndWriter());
        outputStream.close();
        BufferedReader br = new BufferedReader(new FileReader(f));
        MultiClassChunkEvalStats stats = new MultiClassChunkEvalStats("O");
        score = stats.score(br, "\t");
        System.err.println(stats.getConllEvalString());
        f.delete();
      } catch (Exception ex) {
        throw new RuntimeException(ex);
      }
View Full Code Here

Examples of edu.stanford.nlp.trees.Tree.score()

              iii++;
              Tree tb = sot.object();
              Tree tbd = debinarizer.transformTree(tb);
              tbd = subcategoryStripper.transformTree(tbd);
              pq.restoreOriginalWords(tbd);
              pwOut.println("PCFG Parse #" + iii + " with score " + tbd.score());
              tbd.pennPrint(pwOut);
              Tree tbtr = collinizer.transformTree(tbd);
              // pwOut.println("Tree size = " + tbtr.size() + "; depth = " + tbtr.depth());
              kGoodLB.evaluate(tbtr, transGoldTree, pwErr);
            }
View Full Code Here

Examples of edu.stanford.nlp.util.EditDistance.score()

        } else {
          String combo = l1[j] + "#" + l2[i];
          if (l1[j].equals(l2[i]) || seenFuzzyMatches.contains(combo))
            d1 = true;
          else {
            d1 = editDistance.score(l1[j], l2[i]) <= 1;
            if (!d1) {
              String combo2 = l1[j] + "#" + subl2[i];
              if (l1[j].equals(subl2[i]) || seenFuzzyMatches.contains(combo2))
                d2 = true;
              else {
View Full Code Here

Examples of edu.ucla.sspace.clustering.criterion.CriterionFunction.score()

        double[] referenceScores = new double[gapMatrices.length];
        for (int j = 0; j < gapMatrices.length; ++j) {
            verbose("Clustering reference data %d \n", j);
            Assignments result = DirectClustering.cluster(
                    gapMatrices[j], k, 1, function);
            referenceScores[j] = Math.log(function.score());
            referenceScore += referenceScores[j];
        }
        referenceScore /= numGaps;

        // Compute the standard deviation for the reference scores.
View Full Code Here

Examples of edu.ucla.sspace.clustering.criterion.CriterionFunction.score()

                matrix, k, 1, function);

        // Compute the difference between the two scores.  If the
        // current score is less than the previous score, then the
        // previous assignment is considered best.
        double gap = Math.log(function.score());
        verbose("Completed iteration with referenceScore: %f, gap:%f\n",
                referenceScore, gap);
        gap = referenceScore - gap;

        System.out.printf("k: %d gap: %f std: %f\n", i, gap, referenceStdev);
View Full Code Here

Examples of edu.ucla.sspace.evaluation.WordChoiceReport.score()

        // Run the word choice tests.
        for (WordChoiceEvaluation wordChoice : wordChoiceTests) {
            WordChoiceReport report = WordChoiceEvaluationRunner.evaluate(
                        sspace, wordChoice, similarity);
            verbose("Results for %s:%n%s%n", wordChoice, report);
            results[resultIndex++] = String.format("%4.3f", report.score());
        }

        // Run the word similarity tests.
        for (WordSimilarityEvaluation wordSimilarity :
                 wordSimilarityTests) {
View Full Code Here

Examples of edu.umd.cs.findbugs.cloud.Cloud.UserDesignation.score()

                }
                if (addMessages) {
                    int ageInDays = ageInDays(bugCollection, firstSeen);
                    attributeList.addAttribute("ageInDays", Integer.toString(ageInDays));
                    if (reviews > 0 && consensus != UserDesignation.UNCLASSIFIED) {
                        if (consensus.score() < 0) {
                            attributeList.addAttribute("notAProblem", "true");
                        }
                        if (consensus.score() > 0) {
                            attributeList.addAttribute("shouldFix", "true");
                        }
View Full Code Here

Examples of fr.neatmonster.nocheatplus.utilities.ActionAccumulator.score()

  public void testClear(){
    ActionAccumulator acc = new ActionAccumulator(50, 10);
    fill(acc);
    acc.clear();
    if (acc.count() != 0) fail("Expect 0 count after clear, got: " + acc.count());
    if (acc.score() != 0) fail("Expect 0 score after clear, got: " + acc.score());
    for (int i = 0; i < acc.numberOfBuckets(); i++){
      if (acc.bucketCount(i) != 0) fail("Expect 0 count at " + i + " after clear, got: " + acc.bucketCount(i));
      if (acc.bucketScore(i) != 0) fail("Expect 0 score at " + i + " after clear, got: " + acc.bucketScore(i));
    }
  }
View Full Code Here

Examples of fr.neatmonster.nocheatplus.utilities.ActionAccumulator.score()

  public void testClear(){
    ActionAccumulator acc = new ActionAccumulator(50, 10);
    fill(acc);
    acc.clear();
    if (acc.count() != 0) fail("Expect 0 count after clear, got: " + acc.count());
    if (acc.score() != 0) fail("Expect 0 score after clear, got: " + acc.score());
    for (int i = 0; i < acc.numberOfBuckets(); i++){
      if (acc.bucketCount(i) != 0) fail("Expect 0 count at " + i + " after clear, got: " + acc.bucketCount(i));
      if (acc.bucketScore(i) != 0) fail("Expect 0 score at " + i + " after clear, got: " + acc.bucketScore(i));
    }
  }
View Full Code Here

Examples of fr.neatmonster.nocheatplus.utilities.ActionFrequency.score()

      freq = new ActionFrequency(nBuckets, durBucket);
      entries.put(key, freq);
      return 0.0f;
    }
    freq.update(ts);
    float score = Math.min(1.0f, freq.score(factor));
    freq.add(ts, 1.0f);
    return score;
  }
 
}
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.