public UnrolledGraph unrollStructureOnly (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls, false); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
public UnrolledGraph unroll (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
public UnrolledGraph unrollStructureOnly (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls, false); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
private void collectSomeUnsupportedWeights (InstanceList training, BitSet[] weightsPresent) { for (int ii = 0; ii < training.size(); ii++) { Instance inst = training.get (ii); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, new ArrayList (), true); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet vs = (UnrolledVarSet) it.next (); Factor f = vs.getFactor (); Factor nrmed = f.normalize (); for (AssignmentIterator assnIt = nrmed.assignmentIterator (); assnIt.hasNext ();) { if (nrmed.value (assnIt) > SOME_UNSUPPORTED_THRESHOLD) { addPresentFeatures (weightsPresent [assnIt.indexOfCurrentAssn ()], vs.fv); } assnIt.advance (); } } } }
private int cliqueSizeFromInstance (InstanceList training) { int maxWeight = 0; for (int i = 0; i < training.size(); i++) { Instance instance = training.get (i); UnrolledGraph unrolled = new UnrolledGraph (instance, new Template[] { this }, null, false); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet clique = (UnrolledVarSet) it.next (); if (clique.tmpl == this) { int thisWeight = clique.weight (); if (thisWeight > maxWeight) { maxWeight = thisWeight; } } } } if (maxWeight == 0) logger.warning ("***ACRF: Don't know size of "+this+". Never needed in training data."); return maxWeight; }
private void collectSomeUnsupportedWeights (InstanceList training, BitSet[] weightsPresent) { for (int ii = 0; ii < training.size(); ii++) { Instance inst = training.get (ii); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, new ArrayList (), true); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet vs = (UnrolledVarSet) it.next (); Factor f = vs.getFactor (); Factor nrmed = f.normalize (); for (AssignmentIterator assnIt = nrmed.assignmentIterator (); assnIt.hasNext ();) { if (nrmed.value (assnIt) > SOME_UNSUPPORTED_THRESHOLD) { addPresentFeatures (weightsPresent [assnIt.indexOfCurrentAssn ()], vs.fv); } assnIt.advance (); } } } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, templates, null, false); totalNodes =+ unrolled.numVariables (); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet clique = (UnrolledVarSet) it.next(); int tidx = clique.tmpl.index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.fv); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } } }
private void collectSomeUnsupportedWeights (InstanceList training, BitSet[] weightsPresent) { for (int ii = 0; ii < training.size(); ii++) { Instance inst = training.get (ii); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, new ArrayList (), true); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet vs = (UnrolledVarSet) it.next (); Factor f = vs.getFactor (); Factor nrmed = f.normalize (); for (AssignmentIterator assnIt = nrmed.assignmentIterator (); assnIt.hasNext ();) { if (nrmed.value (assnIt) > SOME_UNSUPPORTED_THRESHOLD) { addPresentFeatures (weightsPresent [assnIt.indexOfCurrentAssn ()], vs.fv); } assnIt.advance (); } } } }
public UnrolledGraph unroll (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
public UnrolledGraph unrollStructureOnly (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls, false); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
public UnrolledGraph unroll (Instance inst) { UnrolledGraph g; if (cacheUnrolledGraphs && graphCache.containsKey (inst)) { g = (UnrolledGraph) graphCache.get (inst); g.recomputeFactors (); } else { g = new UnrolledGraph (inst, templates, fixedPtls); if (graphProcessor != null) graphProcessor.process (g, inst); } if (cacheUnrolledGraphs) graphCache.put (inst, g); return g; }
private void collectConstraintsForInstance (InstanceList ilist, int inum) { Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, false); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next(); int tidx = clique.getTemplate().index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.getFv ()); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } }
private void collectConstraintsForInstance (InstanceList ilist, int inum) { Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, false); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next(); int tidx = clique.getTemplate().index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.getFv ()); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } }
private void collectConstraintsForInstance (InstanceList ilist, int inum) { Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, false); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next(); int tidx = clique.getTemplate().index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.getFv ()); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } }
private void collectWeightsPresent (InstanceList ilist, BitSet[] weightsPresent) { for (int inum = 0; inum < ilist.size(); inum++) { Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, null, false); collectTransitionsPresentForGraph (unrolled); collectWeightsPresentForGraph (unrolled, weightsPresent); } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, true); Assignment assn = unrolled.getAssignment (); collectConstraintsForGraph (unrolled, assn); } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, true); Assignment assn = unrolled.getAssignment (); collectConstraintsForGraph (unrolled, assn); } }
private void collectWeightsPresent (InstanceList ilist, BitSet[] weightsPresent) { for (int inum = 0; inum < ilist.size(); inum++) { Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, null, false); collectTransitionsPresentForGraph (unrolled); collectWeightsPresentForGraph (unrolled, weightsPresent); } }
private void collectWeightsPresent (InstanceList ilist, BitSet[] weightsPresent) { for (int inum = 0; inum < ilist.size(); inum++) { Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, new Template[] { this }, null, false); collectTransitionsPresentForGraph (unrolled); collectWeightsPresentForGraph (unrolled, weightsPresent); } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); ACRF.UnrolledGraph unrolled = new ACRF.UnrolledGraph (inst, templates, null, true); Assignment assn = unrolled.getAssignment (); collectConstraintsForGraph (unrolled, assn); } }