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

Yield.contains介绍

暂无

代码示例

代码示例来源：origin: microth/PathLSTM

for (int i = this.first().idx; i <= this.last().idx; ++i) {
  Word curWord = sen.get(i);
  if (this.contains(curWord)) { // If this yield contain the word, add

代码示例来源：origin: com.googlecode.mate-tools/srl

/**
   * Breaks this yield down to continuous yields if this yield is discontinuous, otherwise it returns itself in a list.
   * Yields are labeled lab, C-lab, C-C-lab, etc in a sequential manner from left to right.
   * It follows algorithm 5.3 in Richard Johansson (2008), page 88
   * @return a collection of continuous yields 
   */
  public Collection<Yield> explode() {
    if(isContinuous())
      return Arrays.asList(this);
    Collection<Yield> ret=new TreeSet<Yield>();
    String curArgLabel=argLabel;
    Yield subYield=new Yield(pred,sen,curArgLabel);
    for(int i=sen.indexOf(this.first());i<=sen.indexOf(this.last());++i){
      Word curWord=sen.get(i);
      if(this.contains(curWord)){ //If this yield contain the word, add it, it's continuous.
        subYield.add(curWord);
      } else if(!subYield.isEmpty()) {   //If this yield doesn't contain the word, and we have an unempty subyield, then the subyield is completed
        ret.add(subYield);
        curArgLabel="C-"+curArgLabel;
        subYield=new Yield(pred,sen,curArgLabel);
      }
    }
    if(!subYield.isEmpty()) //Add the last subyield
      ret.add(subYield);
    return ret;
  }
}