Package com.clearnlp.dependency

Examples of com.clearnlp.dependency.DEPLabel

156
157
158
159
160
161
162
163
164
165
166
167
168
169
  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];
   
    if (head.i == i_lambda)
      return new DEPLabel(LB_RIGHT, head.s);
   
    return new DEPLabel(LB_NO, "");
  }
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
370
  /** Called by {@link #getLabel()}. */
  private DEPLabel getAutoLabel(StringFeatureVector vector, DEPState state)
  {
    List<StringPrediction> ps = getPredictions(vector, state);

    DEPLabel fst = new DEPLabel(ps.get(0).label, ps.get(0).score);
    DEPLabel snd = new DEPLabel(ps.get(1).label, ps.get(1).score);
   
    if (fst.score - snd.score < d_margin)
    {
      if (fst.isArc(LB_NO))
        state.add2ndHead(snd);
View Full Code Here
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
 
  protected void processHeadlessAux(DEPNode node, int dir, Triple<DEPNode,String,Double> max, DEPState state)
  {
    int i, size = state.getTreeSize();
    List<StringPrediction> ps;
    DEPLabel label;
    DEPNode  head;
   
    if (dir < 0)  state.setBeta(node.id);
    else      state.setLambda(node.id);
   
    for (i=node.id+dir; 0<=i && i<size; i+=dir)
    {
      head = state.getNode(i);     
      if (head.isDescendentOf(node))  continue;
     
      if (dir < 0)  state.setLambda(i);
      else      state.setBeta(i);
     
      ps = getPredictions(getFeatureVector(f_xmls[0], state), state);
     
      for (StringPrediction p : ps)
      {
        if (p.score <= max.o3)
          break;
       
        label = new DEPLabel(p.label);
       
        if ((dir < 0 && label.isArc(LB_RIGHT)) || (dir > 0 && label.isArc(LB_LEFT)))
        {
          max.set(head, label.deprel, p.score);
          break;
        }
      }
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
  }
 
  private void branch(DEPState state)
  {
    state.disableBranching();
    DEPLabel label;
   
    while ((label = state.setToNextState()) != null)
    {
      parseAux(label, state);
      parseOne(state);
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
    DEPNode beta   = state.getBeta();
   
    int i, size = ps.size(), count = 0;
    boolean lChanged, gChanged = false;
    StringPrediction prediction;
    DEPLabel label;
   
    for (i=0; i<size; i++)
    {
      lChanged = false;
      prediction = ps.get(i);
      label = new DEPLabel(prediction.label, prediction.score);
     
      if (label.isArc(LB_LEFT))
      {
        if (rerankUnique(prediction, label, beta, DEPLibEn.P_SBJ, lambda.id+1, beta.id, state))
          lChanged = true;
        else if (rerankNonHead(prediction, beta))
          lChanged = true;
      }
      else if (label.isArc(LB_RIGHT))
      {
        if (rerankUnique(prediction, label, lambda, DEPLibEn.P_SBJ, 1, beta.id, state))
          lChanged = true;
        else if (rerankNonHead(prediction, lambda))
          lChanged = true;
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
    return g_labels;
  }
 
  public DEPLabel getGoldLabel()
  {
    DEPLabel label = getGoldLabelArc();
   
    if (label.isArc(LB_LEFT))
      label.list = isGoldReduce(true) ? LB_REDUCE : LB_PASS;
    else if (label.isArc(LB_RIGHT))
      label.list = isGoldShift() ? LB_SHIFT : LB_PASS;
    else
    {
      if      (isGoldShift())      label.list = LB_SHIFT;
      else if (isGoldReduce(false))  label.list = LB_REDUCE;
View Full Code Here
156
157
158
159
160
161
162
163
164
165
166
167
168
169
  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];
   
    if (head.i == i_lambda)
      return new DEPLabel(LB_RIGHT, head.s);
   
    return new DEPLabel(LB_NO, "");
  }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
 
  @Override
  public Set<String> getLabels()
  {
    Set<String> set = Sets.newHashSet();
    DEPLabel lb;
   
    for (StringModel model : s_models)
    {
      for (String label : model.getLabels())
      {
        lb = new DEPLabel(label);
        set.add(lb.deprel);
      }
    }
   
    return set;
View Full Code Here
256
257
258
259
260
261
262
263
264
265
266
 
  protected List<StringInstance> parseOne(DEPState state)
  {
    List<StringInstance> insts = Lists.newArrayList();
    DEPNode  lambda, beta;
    DEPLabel label;
   
    while (state.isBetaValid())
    {
      if (!state.isLambdaValid())
      {
View Full Code Here
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
 
  /** Called by {@link #parse()}. */
  protected DEPLabel getLabel(List<StringInstance> insts, DEPState state)
  {
    StringFeatureVector vector = getFeatureVector(f_xmls[0], state);
    DEPLabel label = null;
   
    if (isTrain())
    {
      label = state.getGoldLabel();
      insts.add(new StringInstance(label.toString(), vector));
    }
    else if (isDevelopOrDecode())
    {
      label = getAutoLabel(vector, state);
    }
View Full Code Here
TOP

Related Classes of com.clearnlp.dependency.DEPLabel

  • com.clearnlp.component.dep.AbstractDEPParser
  • com.clearnlp.component.dep.EnglishDEPParser
  • com.clearnlp.component.state.DEPState
  • com.clearnlp.component.state.ParseState
    • 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.