Package com.clearnlp.dependency

Examples of com.clearnlp.dependency.DEPArc

860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
      return false;

    List<DEPArc> deps = verb.getDependents();
    int i, size = deps.size();
    DEPNode node;
    DEPArc  dep;
   
    for (i=0; i<size; i++)
    {
      dep  = deps.get(i);
      node = dep.getNode();
     
      if (node.id < verb.id)
      {
        if (dep.isLabel(DEPLibEn.DEP_COMPLM) || dep.isLabel(DEPLibEn.DEP_MARK))
          return false;
       
        if (dep.isLabel(P_AUX) && !node.isLemma("do"))
          return false;
       
        if (node.isPos(CTLibEn.POS_TO) || node.isPos(CTLibEn.POS_MD) || node.pos.startsWith("W"))
          return false; 
      }
     
      if (dep.isLabel(P_SBJ) || dep.isLabel(DEPLibEn.DEP_EXPL))
        return false;
    }
   
    return true;
  }
View Full Code Here
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
    Pattern pSbj = Pattern.compile("^[nc]subj.*");
    Pattern pAux = Pattern.compile("^aux.*");
    List<DEPArc> deps = verb.getDependents();
    int i, size = deps.size();
    boolean hasAux = false;
    DEPArc  curr, prev;
    String  label;
    DEPNode node;
   
    for (i=size-1; i>=0; i--)
    {
      curr  = deps.get(i);
      node  = curr.getNode();
      label = curr.getLabel();
     
      if (curr.isLabel(DEPLibEn.DEP_PUNCT))
      {
        if (pPeriod.matcher(node.lemma).find())
          return;
      }
    }
   
    for (i=0; i<size; i++)
    {
      curr  = deps.get(i);
      node  = curr.getNode();
      label = curr.getLabel();
     
      if (node.id > verb.id)
        break;
     
      if (pAux.matcher(label).find())
View Full Code Here
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
      return false;

    List<DEPArc> deps = verb.getDependents();
    int i, size = deps.size();
    DEPNode node;
    DEPArc  dep;
   
    for (i=0; i<size; i++)
    {
      dep  = deps.get(i);
      node = dep.getNode();
     
      if (node.id < verb.id)
      {
        if (dep.isLabel(DEPLibEn.DEP_COMPLM) || dep.isLabel(DEPLibEn.DEP_MARK))
          return false;
       
        if (dep.isLabel(P_AUX) && !node.isLemma("do"))
          return false;
       
        if (node.isPos(CTLibEn.POS_TO) || node.isPos(CTLibEn.POS_MD) || node.pos.startsWith("W"))
          return false; 
      }
     
      if (dep.isLabel(P_SBJ) || dep.isLabel(DEPLibEn.DEP_EXPL))
        return false;
    }
   
    return true;
  }
View Full Code Here
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
    Pattern pSbj = Pattern.compile("^[nc]subj.*");
    Pattern pAux = Pattern.compile("^aux.*");
    List<DEPArc> deps = verb.getDependents();
    int i, size = deps.size();
    boolean hasAux = false;
    DEPArc  curr, prev;
    String  label;
    DEPNode node;
   
    for (i=size-1; i>=0; i--)
    {
      curr  = deps.get(i);
      node  = curr.getNode();
      label = curr.getLabel();
     
      if (curr.isLabel(DEPLibEn.DEP_PUNCT))
      {
        if (pPeriod.matcher(node.lemma).find())
          return;
      }
    }
   
    for (i=0; i<size; i++)
    {
      curr  = deps.get(i);
      node  = curr.getNode();
      label = curr.getLabel();
     
      if (node.id > verb.id)
        break;
     
      if (pAux.matcher(label).find())
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
    List<DEPArc> args;
    PBRoleset roleset;
    String label, n;
    DEPNode node;
    int i, size;
    DEPArc arg;
   
    while ((pred = tree.getNextPredicate(pred.id)) != null)
    {
      args = argLists.get(pred.id);
      size = args.size();
     
      for (i=0; i<size; i++)
      {
        arg   = args.get(i);
        label = arg.getLabel();
       
        if (SRLLib.P_ARG_REF.matcher(label).find())
        {
          if ((n = PBLib.getNumber(label)) != null && !containsNumberedArugment(args, n, 0, i) && containsNumberedArugment(args, n, i+1, size))
          {
            roleset = m_frames.getRoleset(getPBType(pred), pred.lemma, pred.getFeat(DEPLibEn.FEAT_PB));
            n = Integer.toString(Integer.parseInt(n)+1);
           
            if (roleset.isValidArgumentNumber(n) && !containsNumberedArugment(args, n, i+1, size))
            {
              node = arg.getNode();
              node.getSHead(pred).setLabel(SRLLib.PREFIX_REFERENT+"A"+n);
            }
          }
         
          break;
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
    }
  }
 
  private boolean containsNumberedArugment(List<DEPArc> arguments, String n, int bIdx, int eIdx)
  {
    DEPArc arg;
    int i;
   
    for (i=bIdx; i<eIdx; i++)
    {
      arg = arguments.get(i);
     
      if (n.equals(PBLib.getNumber(arg.getLabel())))
        return true;
    }
   
    return false;
  }
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
  protected void initArcs(DEPTree tree)
  {
    int i, j, len, size = tree.size();
    DEPNode curr, prev, next;
    List<DEPArc> deps;
    DEPArc lmd, rmd;
   
    lm_deps = new DEPNode[size];
    rm_deps = new DEPNode[size];
    ln_sibs = new DEPNode[size];
    rn_sibs = new DEPNode[size];
   
    d_tree.setDependents();
   
    for (i=1; i<size; i++)
    {
      deps = d_tree.get(i).getDependents();
      if (deps.isEmpty())  continue;
     
      len = deps.size();
      lmd = deps.get(0);
      rmd = deps.get(len-1);
     
      if (lmd.getNode().id < i)  lm_deps[i] = lmd.getNode();
      if (rmd.getNode().id > i)  rm_deps[i] = rmd.getNode();
     
      for (j=1; j<len; j++)
      {
        curr = deps.get(j  ).getNode();
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
      node = tree.get(i);
     
      for (DEPArc arc : node.getSHeads())
      {
        args = list.get(arc.getNode().id);
        args.add(new DEPArc(node, arc.getLabel()));
      }
    }
   
    return list;
  }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
  }

  static public void relinkRelativeClause(SRLTree sTree)
  {
    DEPNode pred = sTree.getPredicate();
    DEPArc ref = null;
    DEPNode dep, arg;
   
    for (DEPArc arc : pred.getDependents())
    {
      dep = arc.getNode();
     
      if (dep.containsSHead(pred, P_ARG_REF))
      {
        ref = arc;
        break;
      }
    }
   
    for (SRLArc sArc : sTree.getArguments())
    {
      arg = sArc.getNode();
     
      for (DEPArc dArc : arg.getDependents())
      {
        dep = dArc.getNode();
       
        if (dep == pred || pred.isDescendentOf(dep))
        {
          arg.removeDependent(dArc);
          dep.setHead(arg.getHead(), arg.getLabel());
         
          if (ref != null) // && ref.isLabel(SRLLib.S_PREFIX_REFERENT+arg.getLabel())
          {
            DEPNode rDep = ref.getNode();
            DEPArc rHead = rDep.getSHead(pred);
            DEPArc whose = rDep.getAnyDescendentArcByPOS(CTLibEn.POS_WPS);
           
            if (whose != null)
            {
              DEPNode tmp = whose.getNode();
              arg.setHead(tmp.getHead(), tmp.getLabel());
              arg.id = tmp.id;
              whose.setNode(arg);
              rHead.setLabel(sArc.getLabel());
              arg.removeSHead(pred);
             
              tmp = arg.getLastNode();
              tmp.form = LGLibEn.getPossessiveForm(tmp.form);
            }
            else if (ref.isLabel(DEPLibEn.DEP_PREP))
            {
              DEPArc tmp = new DEPArc(arg, DEPLibEn.DEP_POBJ);
             
              arg.setHead(rDep, tmp.getLabel());
              arg.id = rDep.id + 1;
              rDep.clearDependents();
              rDep.addDependent(tmp);
              rHead.setLabel(sArc.getLabel());
              arg.removeSHead(pred);
            }
            else if (ref.isLabel(DEPLibEn.P_SBJ))
            {
              arg.setHead(pred, ref.getLabel());
              arg.id = rDep.id;
              ref.setNode(arg);
              rHead.setLabel(sArc.getLabel());
            }
            else
            {
              DEPArc tmp = new DEPArc(arg, ref.getLabel());
              arg.setHead(pred, tmp.getLabel());
              arg.id = pred.id + 1;
             
              if (ref.isLabel(DEPLibEn.P_OBJ) || ref.isLabel(DEPLibEn.DEP_ATTR))
                pred.addDependentRightNextToSelf(tmp);
              else
                pred.addDependent(tmp);
             
              pred.removeDependent(ref);
            }
          }
          else
          {
            DEPArc tmp = new DEPArc(arg, DEPLibEn.DEP_DEP);
            arg.setHead(pred, tmp.getLabel());
            arg.id = pred.id + 1;
           
            if (sArc.isLabel(PBLib.P_ARGN))
              pred.addDependentRightNextToSelf(tmp);
            else
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
    DEPNode pred = sTree.getPredicate();
    boolean noSbj = pred.getDependentsByLabels(DEPLibEn.P_SBJ).isEmpty();
    Deque<DEPNode> conjuncts;
    List<DEPArc> arcs;
    DEPNode conj, dep;
    DEPArc sArc;
 
    conjuncts = DEPLibEn.getPreviousConjuncts(pred);
   
    if (!conjuncts.isEmpty())
    {
      conj = conjuncts.getLast();
      arcs = conj.getDependents();
     
      int i; for (i=arcs.size()-1; i>=0; i--)
      {
        dep = arcs.get(i).getNode();
        sArc = dep.getSHead(pred);
       
        if (noSbj && (dep.isLabel(DEPLibEn.P_SBJ) || dep.isLabel(DEPLibEn.P_AUX)) || (sArc != null && sArc.isLabel(ARGM_NEG)))
        {
          dep.setHead(pred);
          pred.addDependentFront(new DEPArc(dep, dep.getLabel()));
        }
        else if (dep.containsSHead(pred))
        {
          dep.setHead(pred);
          dep.id = pred.id+1;
          pred.addDependent(new DEPArc(dep, dep.getLabel()));
        }
      }
    }
   
    conjuncts = DEPLibEn.getNextConjuncts(pred);
   
    if (!conjuncts.isEmpty())
    {
      conj = conjuncts.getLast();
     
      for (DEPArc arc : conj.getDependents())
      {
        dep = arc.getNode();
       
        if (dep.containsSHead(pred))
        {
          dep.setHead(pred);
          pred.addDependent(new DEPArc(dep, dep.getLabel()));
        }
      }
    }
  }
View Full Code Here
TOP

Related Classes of com.clearnlp.dependency.DEPArc

  • com.clearnlp.component.srl.EnglishSRLabeler
  • com.clearnlp.component.state.SRLState
  • com.clearnlp.component.util.CSenTypeClassifierEN
  • com.clearnlp.dependency.srl.SRLLib
  • com.clearnlp.experiment.Tmp
  • com.clearnlp.generation.LGAnswerGenerator
  • com.clearnlp.reader.JointReader
    • 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.