cc.mallet.types.Alphabet.contains()方法的使用及代码示例

x33g5p2x  于2022-01-16 转载在 其他  
字(3.9k)|赞(0)|评价(0)|浏览(112)

本文整理了Java中cc.mallet.types.Alphabet.contains()方法的一些代码示例,展示了Alphabet.contains()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Alphabet.contains()方法的具体详情如下:
包路径:cc.mallet.types.Alphabet
类名称:Alphabet
方法名:contains

Alphabet.contains介绍

暂无

代码示例

代码示例来源:origin: org.cleartk/cleartk-ml-mallet

  1. public Instance toInstance(List<Feature> features) throws CleartkEncoderException {
  2. List<NameNumber> nameNumbers = featuresEncoder.encodeAll(features);
  3. Iterator<NameNumber> nameNumberIterator = nameNumbers.iterator();
  4. while (nameNumberIterator.hasNext()) {
  5. NameNumber nameNumber = nameNumberIterator.next();
  6. if (!alphabet.contains(nameNumber.name))
  7. nameNumberIterator.remove();
  8. }
  9. String[] keys = new String[nameNumbers.size()];
  10. double[] values = new double[nameNumbers.size()];
  11. for (int i = 0; i < nameNumbers.size(); i++) {
  12. NameNumber nameNumber = nameNumbers.get(i);
  13. keys[i] = nameNumber.name;
  14. values[i] = nameNumber.number.doubleValue();
  15. }
  16. int[] keyIndices = FeatureVector.getObjectIndices(keys, alphabet, true);
  17. FeatureVector fv = new FeatureVector(alphabet, keyIndices, values);
  18. Instance instance = new Instance(fv, null, null, null);
  19. return instance;
  20. }
  21. }

代码示例来源:origin: ClearTK/cleartk

  1. public Instance toInstance(List<Feature> features) throws CleartkEncoderException {
  2. List<NameNumber> nameNumbers = featuresEncoder.encodeAll(features);
  3. Iterator<NameNumber> nameNumberIterator = nameNumbers.iterator();
  4. while (nameNumberIterator.hasNext()) {
  5. NameNumber nameNumber = nameNumberIterator.next();
  6. if (!alphabet.contains(nameNumber.name))
  7. nameNumberIterator.remove();
  8. }
  9. String[] keys = new String[nameNumbers.size()];
  10. double[] values = new double[nameNumbers.size()];
  11. for (int i = 0; i < nameNumbers.size(); i++) {
  12. NameNumber nameNumber = nameNumbers.get(i);
  13. keys[i] = nameNumber.name;
  14. values[i] = nameNumber.number.doubleValue();
  15. }
  16. int[] keyIndices = FeatureVector.getObjectIndices(keys, alphabet, true);
  17. FeatureVector fv = new FeatureVector(alphabet, keyIndices, values);
  18. Instance instance = new Instance(fv, null, null, null);
  19. return instance;
  20. }
  21. }

代码示例来源:origin: cc.mallet/mallet

  1. if (queryWord != null && vocabulary.contains(queryWord)) {
  2. findClosest(copy(queryWord));

代码示例来源:origin: de.julielab/jcore-mallet-2.0.9

  1. if (alphabet.contains(token) && length >= minimumLength) {
  2. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  3. numTokens++;
  4. if (alphabet.contains(token) && length >= minimumLength) {
  5. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  6. numTokens++;

代码示例来源:origin: com.github.steveash.mallet/mallet

  1. if (alphabet.contains(token) && length >= minimumLength) {
  2. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  3. numTokens++;
  4. if (alphabet.contains(token) && length >= minimumLength) {
  5. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  6. numTokens++;

代码示例来源:origin: com.github.steveash.mallet/mallet

  1. boolean[] keepers = new boolean[length];
  2. for (int i = 0; i < length; i++) {
  3. if (newAlphabet.contains(dictionary.lookupObject(features[i]))) {
  4. keepers[i] = true;
  5. newLength++;

代码示例来源:origin: cc.mallet/mallet

  1. if (alphabet.contains(token) && length >= minimumLength) {
  2. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  3. numTokens++;
  4. if (alphabet.contains(token) && length >= minimumLength) {
  5. tokenBuffer[numTokens] = alphabet.lookupIndex(token);
  6. numTokens++;

代码示例来源:origin: de.julielab/jcore-mallet-2.0.9

  1. boolean[] keepers = new boolean[length];
  2. for (int i = 0; i < length; i++) {
  3. if (newAlphabet.contains(dictionary.lookupObject(features[i]))) {
  4. keepers[i] = true;
  5. newLength++;

代码示例来源:origin: cc.mallet/mallet

  1. boolean[] keepers = new boolean[length];
  2. for (int i = 0; i < length; i++) {
  3. if (newAlphabet.contains(dictionary.lookupObject(features[i]))) {
  4. keepers[i] = true;
  5. newLength++;

代码示例来源:origin: com.github.steveash.mallet/mallet

  1. if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) {
  2. bs.set(feature);

代码示例来源:origin: cc.mallet/mallet

  1. if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) {
  2. bs.set(feature);

代码示例来源:origin: de.julielab/jcore-mallet-2.0.9

  1. if (newAlphabet.contains(oldAlphabet.lookupObject(feature))) {
  2. bs.set(feature);

相关文章