本文整理了Java中se.lth.cs.srl.corpus.Yield.first()
方法的一些代码示例,展示了Yield.first()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Yield.first()
方法的具体详情如下:
包路径:se.lth.cs.srl.corpus.Yield
类名称:Yield
方法名:first
暂无
代码示例来源:origin: com.googlecode.mate-tools/srl
/**
* Compares yields. Yields are sorted according to their left-most token.
* I.e. with three yields with first element tokens with ID's 1, 7, and 5 respectively,
* they will be sorted in the order 1, 5, 7, regardless of gaps and continuity
*/
@Override
public int compareTo(Yield y) {
return this.first().getMySentence().wordComparator.compare(this.first(),y.first());
}
/**
代码示例来源:origin: microth/PathLSTM
/**
* Compares yields. Yields are sorted according to their left-most token.
* I.e. with three yields with first element tokens with ID's 1, 7, and 5
* respectively, they will be sorted in the order 1, 5, 7, regardless of
* gaps and continuity
*/
@Override
public int compareTo(Yield y) {
return this.first().getMySentence().wordComparator.compare(
this.first(), y.first());
}
代码示例来源:origin: microth/PathLSTM
/**
* Checks whether this yield is continuous, ie they contain all the words in
* the sentence between this.first() and this.last(). Yields with 1 word are
* always continuous
*
* @return true if this yield is continuous, false otherwise
*/
public boolean isContinuous() {
if (this.size() < 2)
return true;
int senIndex = this.first().idx;
for (Word w : this) {
if (w.idx != senIndex++)
return false;
}
return true;
}
代码示例来源:origin: com.googlecode.mate-tools/srl
/**
* Checks whether this yield is continuous, ie they contain all the words in the
* sentence between this.first() and this.last(). Yields with 1 word are always continuous
* @return true if this yield is continuous, false otherwise
*/
public boolean isContinuous(){
if(this.size()<2)
return true;
int senIndex=sen.indexOf(this.first());
for(Word w:this){
if(sen.get(senIndex++)!=w)
return false;
}
return true;
}
代码示例来源:origin: com.googlecode.mate-tools/srl
errors.append("])).\n");
int blankColSpan=sen.indexOf(y.first())-indexCount;
if(blankColSpan>0){
ret.append("<td colspan=\"").append(blankColSpan).append("\"> </td>");
continue;
int argColWidth=sen.indexOf(y.last())-sen.indexOf(y.first())+1;
String argLabel=y.getArgLabel();
ret.append("<td colspan=\"")
代码示例来源:origin: microth/PathLSTM
String curArgLabel = argLabel;
Yield subYield = new Yield(pred, sen, curArgLabel);
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;
}
}
代码示例来源:origin: CogComp/cogcomp-nlp
String argDesc = (frameData != null) ? FramesManager.getArgDcrp(argTag, frameData): "";
Yield y = a.getYield(p, argTag, singleton);
IntPair span = new IntPair(y.first().getIdx() - 1, y.last().getIdx());
String argLabel = (argDesc.length() > 1) ? argTag + "." + argDesc : argTag;
Constituent c = new Constituent(argLabel, viewName, ta,
内容来源于网络,如有侵权,请联系作者删除!