Package com.clearnlp.util.pair

Examples of com.clearnlp.util.pair.StringIntPair

106
107
108
109
110
111
112
113
114
115
    StringIntPair[] ps = new StringIntPair[map.size()-1];
   
    for (ObjectCursor<String> cur : map.keys())
    {
      if (!(value = cur.value).equals(TOTAL))
        ps[i++] = new StringIntPair(value, map.get(value));
    }
   
    return ps;
  }
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
  }
 
  /** Called by {@link #getGoldLabel()}. */
  private DEPLabel getGoldLabelArc()
  {
    StringIntPair head = g_labels[i_lambda];
   
    if (head.i == i_beta)
      return new DEPLabel(LB_LEFT, head.s);
   
    head = g_labels[i_beta];
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
    return Collections.max(l_branches);
  }
 
  public void setGoldScoresToBranches()
  {
    StringIntPair   gHead, sHead;
    StringIntPair[] sHeads;
    int i, c;
   
    for (ObjectsDoubleTriple<List<StringInstance>,StringIntPair[]> branch : l_branches)
    {
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
  }
 
  /** Called by {@link #getGoldLabel()}. */
  private DEPLabel getGoldLabelArc()
  {
    StringIntPair head = g_labels[i_lambda];
   
    if (head.i == i_beta)
      return new DEPLabel(LB_LEFT, head.s);
   
    head = g_labels[i_beta];
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
    return Collections.max(l_branches);
  }
 
  public void setGoldScoresToBranches()
  {
    StringIntPair   gHead, sHead;
    StringIntPair[] sHeads;
    int i, c;
   
    for (ObjectsDoubleTriple<List<StringInstance>,StringIntPair[]> branch : l_branches)
    {
View Full Code Here
466
467
468
469
470
471
472
473
474
475
476
    DEPCountArc a;
   
    StringIntPair[] t = lHeads.get(0);
     
    for (i=1; i<size; i++)
      H[i] = new StringIntPair(t[i].s, t[i].i);
     
    T.add(DEPLib.ROOT_ID);
    F.addAll(getArcs(lHeads, T));
     
    while (!F.isEmpty())
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
  {
    Map<String,DEPCountArc> map = new HashMap<String,DEPCountArc>();
    int i, depId, len = size(), size = lHeads.size();
    DEPCountArc val;
    StringIntPair[] heads;
    StringIntPair head;
    String key;
   
    for (i=0; i<size; i++)
    {
      heads = lHeads.get(i);
View Full Code Here
662
663
664
665
666
667
668
669
670
671
672
  }
 
  public void resetHeads(StringIntPair[] heads)
  {
    int i, size = size(), len = heads.length;
    StringIntPair head;
    DEPNode node;
   
    for (i=1; i<len && i<size; i++)
    {
      node = get(i);
View Full Code Here
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
  {
    int i, size = size();
    DEPNode node, head;
   
    StringIntPair[] diff = new StringIntPair[size];
    StringIntPair p;
   
    for (i=1; i<size; i++)
    {
      node = get(i);
      head = node.getHead();
      p    = heads[i];
     
      if (head != null && head.id != p.i && !node.isLabel(p.s))
        diff[i] = new StringIntPair(node.getLabel(), head.id);
      else
        diff[i] = new StringIntPair(null, DEPLib.NULL_ID);
    }
   
    return diff;
  }
View Full Code Here
706
707
708
709
710
711
712
713
714
715
716
  }
 
  public void appendHeads(StringIntPair[] heads)
  {
    int i, size = size();
    StringIntPair p;
   
    for (i=1; i<size; i++)
    {
      p = heads[i];
     
View Full Code Here
TOP

Related Classes of com.clearnlp.util.pair.StringIntPair

  • com.clearnlp.component.evaluation.DEPEval
  • com.clearnlp.component.state.DEPState
  • com.clearnlp.component.state.ParseState
  • com.clearnlp.dependency.DEPLib
  • com.clearnlp.dependency.DEPTree
  • com.clearnlp.run.C2DConvertMulti
  • com.clearnlp.run.SRLEvaluate
  • com.clearnlp.tools.Trinity
  • com.clearnlp.util.map.Prob1DMap
  • com.clearnlp.util.map.Prob2DMap
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.