/** Returns true is term t is a stopword */ public boolean isStopword(final String t) { return stopWords.contains(t); }
public boolean contains(Object object) { return verts.contains(object); }
/** Returns true is term t is a stopword */ public boolean isStopword(final String t) { return stopWords.contains(t); }
public static boolean isMultiWordAdverb(THashSet<String> mAdverbs, String word) { return mAdverbs.contains(word); }
public boolean contains(Object object) { return verts.contains(object); }
public boolean add(Object object, boolean checkSorted) { if (!(object instanceof Variable)) throw new IllegalArgumentException (object.toString ()); if (!verts.contains (object)) { vertsList.add (object); boolean ret = verts.add (object); if (checkSorted) Collections.sort (vertsList); return ret; } else { return false; } }
public boolean add(Object object, boolean checkSorted) { if (!(object instanceof Variable)) throw new IllegalArgumentException (object.toString ()); if (!verts.contains (object)) { vertsList.add (object); boolean ret = verts.add (object); if (checkSorted) Collections.sort (vertsList); return ret; } else { return false; } }
public boolean add(Object object, boolean checkSorted) { if (!(object instanceof Variable)) throw new IllegalArgumentException (object.toString ()); if (!verts.contains (object)) { vertsList.add (object); boolean ret = verts.add (object); if (checkSorted) Collections.sort (vertsList); return ret; } else { return false; } }
/** * Checks to see if term t is a stopword. If so, then the TermPipeline * is exited. Otherwise, the term is passed on to the next TermPipeline * object. This is the TermPipeline implementation part of this object. * @param t The term to be checked. */ public void processTerm(final String t) { if (stopWords.contains(t)) return; next.processTerm(t); }
/** * Checks to see if term t is a stopword. If so, then the TermPipeline * is exited. Otherwise, the term is passed on to the next TermPipeline * object. This is the TermPipeline implementation part of this object. * @param t The term to be checked. */ public void processTerm(final String t) { if (stopWords.contains(t)) return; next.processTerm(t); }
private void piPropagation (FactorGraph mdl, Variable var) { logger.finer ("Pi propagation from "+var); marked.add (var); for (Iterator it = mdl.allFactorsContaining (var).iterator(); it.hasNext();) { Factor child = (Factor) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, var, child); piPropagation (mdl, child); } } }
private void piPropagation (FactorGraph mdl, Variable var) { logger.finer ("Pi propagation from "+var); marked.add (var); for (Iterator it = mdl.allFactorsContaining (var).iterator(); it.hasNext();) { Factor child = (Factor) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, var, child); piPropagation (mdl, child); } } }
private void piPropagation (FactorGraph mdl, Variable var) { logger.finer ("Pi propagation from "+var); marked.add (var); for (Iterator it = mdl.allFactorsContaining (var).iterator(); it.hasNext();) { Factor child = (Factor) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, var, child); piPropagation (mdl, child); } } }
private void piPropagation (FactorGraph mdl, Factor factor) { logger.finer ("Pi propagation from "+factor); marked.add (factor); for (Iterator it = factor.varSet ().iterator(); it.hasNext();) { Variable child = (Variable) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, factor, child); piPropagation (mdl, child); } } }
private void piPropagation (FactorGraph mdl, Factor factor) { logger.finer ("Pi propagation from "+factor); marked.add (factor); for (Iterator it = factor.varSet ().iterator(); it.hasNext();) { Variable child = (Variable) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, factor, child); piPropagation (mdl, child); } } }
private void piPropagation (FactorGraph mdl, Factor factor) { logger.finer ("Pi propagation from "+factor); marked.add (factor); for (Iterator it = factor.varSet ().iterator(); it.hasNext();) { Variable child = (Variable) it.next(); if (!marked.contains (child)) { // sendPiMessage (mdl, var, child); sendMessage (mdl, factor, child); piPropagation (mdl, child); } } }
public Instance pipe (Instance carrier) { TokenSequence ts = (TokenSequence) carrier.getData(); for (int i = 0; i < ts.size(); i++) { Token t = ts.getToken(i); String s = t.getText(); if (lexicon.contains (ignoreCase ? s.toLowerCase() : s)) t.setFeatureValue (name, 1.0); } return carrier; }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }