public ConfidenceEvaluator (Segment[] segments, boolean sorted) { this.confidences = new Vector (); for (int i=0; i < segments.length; i++) { confidences.add (new EntityConfidence (segments[i].getConfidence(), segments[i].correct(), segments[i].getInput(), segments[i].getStart(), segments[i].getEnd())); } if (!sorted) Collections.sort (confidences, new ConfidenceComparator()); this.nBins = DEFAULT_NUM_BINS; this.numCorrect = getNumCorrectEntities (); }
public ConfidenceEvaluator (Segment[] segments, boolean sorted) { this.confidences = new Vector (); for (int i=0; i < segments.length; i++) { confidences.add (new EntityConfidence (segments[i].getConfidence(), segments[i].correct(), segments[i].getInput(), segments[i].getStart(), segments[i].getEnd())); } if (!sorted) Collections.sort (confidences, new ConfidenceComparator()); this.nBins = DEFAULT_NUM_BINS; this.numCorrect = getNumCorrectEntities (); }
public ConfidenceEvaluator (Segment[] segments, boolean sorted) { this.confidences = new Vector (); for (int i=0; i < segments.length; i++) { confidences.add (new EntityConfidence (segments[i].getConfidence(), segments[i].correct(), segments[i].getInput(), segments[i].getStart(), segments[i].getEnd())); } if (!sorted) Collections.sort (confidences, new ConfidenceComparator()); this.nBins = DEFAULT_NUM_BINS; this.numCorrect = getNumCorrectEntities (); }
public boolean equals (Object o) { Segment s = (Segment) o; if (start == s.getStart() && end == s.getEnd() && correct == s.correct() && input.size() == s.getInput().size()) { for (int i=start; i <= end; i++) { if (!pred.get( i ).equals( s.getPredicted( i ) ) || !truth.get( i ).equals( s.getTruth( i ) ) ) return false; } return true; } return false; } }
public boolean equals (Object o) { Segment s = (Segment) o; if (start == s.getStart() && end == s.getEnd() && correct == s.correct() && input.size() == s.getInput().size()) { for (int i=start; i <= end; i++) { if (!pred.get( i ).equals( s.getPredicted( i ) ) || !truth.get( i ).equals( s.getTruth( i ) ) ) return false; } return true; } return false; } }
public boolean equals (Object o) { Segment s = (Segment) o; if (start == s.getStart() && end == s.getEnd() && correct == s.correct() && input.size() == s.getInput().size()) { for (int i=start; i <= end; i++) { if (!pred.get( i ).equals( s.getPredicted( i ) ) || !truth.get( i ).equals( s.getTruth( i ) ) ) return false; } return true; } return false; } }
if (findIncorrect) { for (int j=0; j < orderedSegments.length; j++) { if (!orderedSegments[j].correct()) { leastConfidentSegment = orderedSegments[j]; break; if (findIncorrect && leastConfidentSegment.correct()) { logger.warning ("cannot find incorrect segment, probably because error is in background state\n"); this.leastConfidentSegments.add (null);
if (findIncorrect) { for (int j=0; j < orderedSegments.length; j++) { if (!orderedSegments[j].correct()) { leastConfidentSegment = orderedSegments[j]; break; if (findIncorrect && leastConfidentSegment.correct()) { logger.warning ("cannot find incorrect segment, probably because error is in background state\n"); this.leastConfidentSegments.add (null);
if (findIncorrect) { for (int j=0; j < orderedSegments.length; j++) { if (!orderedSegments[j].correct()) { leastConfidentSegment = orderedSegments[j]; break; if (findIncorrect && leastConfidentSegment.correct()) { logger.warning ("cannot find incorrect segment, probably because error is in background state\n"); this.leastConfidentSegments.add (null);