public Instance toInstance(List<Feature> features) throws CleartkEncoderException { List<NameNumber> nameNumbers = featuresEncoder.encodeAll(features); Iterator<NameNumber> nameNumberIterator = nameNumbers.iterator(); while (nameNumberIterator.hasNext()) { NameNumber nameNumber = nameNumberIterator.next(); if (!alphabet.contains(nameNumber.name)) nameNumberIterator.remove(); } String[] keys = new String[nameNumbers.size()]; double[] values = new double[nameNumbers.size()]; for (int i = 0; i < nameNumbers.size(); i++) { NameNumber nameNumber = nameNumbers.get(i); keys[i] = nameNumber.name; values[i] = nameNumber.number.doubleValue(); } int[] keyIndices = FeatureVector.getObjectIndices(keys, alphabet, true); FeatureVector fv = new FeatureVector(alphabet, keyIndices, values); Instance instance = new Instance(fv, null, null, null); return instance; } }
public Instance toInstance(List<Feature> features) throws CleartkEncoderException { List<NameNumber> nameNumbers = featuresEncoder.encodeAll(features); Iterator<NameNumber> nameNumberIterator = nameNumbers.iterator(); while (nameNumberIterator.hasNext()) { NameNumber nameNumber = nameNumberIterator.next(); if (!alphabet.contains(nameNumber.name)) nameNumberIterator.remove(); } String[] keys = new String[nameNumbers.size()]; double[] values = new double[nameNumbers.size()]; for (int i = 0; i < nameNumbers.size(); i++) { NameNumber nameNumber = nameNumbers.get(i); keys[i] = nameNumber.name; values[i] = nameNumber.number.doubleValue(); } int[] keyIndices = FeatureVector.getObjectIndices(keys, alphabet, true); FeatureVector fv = new FeatureVector(alphabet, keyIndices, values); Instance instance = new Instance(fv, null, null, null); return instance; } }
if (queryWord != null && vocabulary.contains(queryWord)) { findClosest(copy(queryWord));
boolean[] keepers = new boolean[length]; for (int i = 0; i < length; i++) { if (newAlphabet.contains(dictionary.lookupObject(features[i]))) { keepers[i] = true; newLength++;
boolean[] keepers = new boolean[length]; for (int i = 0; i < length; i++) { if (newAlphabet.contains(dictionary.lookupObject(features[i]))) { keepers[i] = true; newLength++;
boolean[] keepers = new boolean[length]; for (int i = 0; i < length; i++) { if (newAlphabet.contains(dictionary.lookupObject(features[i]))) { keepers[i] = true; newLength++;
if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) { bs.set(feature);
if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) { bs.set(feature);
if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) { bs.set(feature);