Package com.clearnlp.constituent

Examples of com.clearnlp.constituent.CTNode

1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
  void printTreesForCKY(String[] args)
  {
    CTReader reader = new CTReader(UTInput.createBufferedFileReader(args[0]));
    PrintStream fout = UTOutput.createPrintBufferedFileStream(args[1]);
    CTTree tree;
    CTNode root;
    int count;
   
    while ((tree = reader.nextTree()) != null)
    {
      root = tree.getRoot();
     
      if (root.getChildrenSize() == 1)
      {
        count = stripPunct(tree);
       
        if (root.getChildrenSize() > 0 && tree.getTokens().size()-count >= 4 && !containsEmptyCategories(tree) && isCKYTree(root.getChild(0)))
          fout.println(tree+"\n");
      }
    }
   
    reader.close();
View Full Code Here
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
  void printTreesForCKY(String[] args)
  {
    CTReader reader = new CTReader(UTInput.createBufferedFileReader(args[0]));
    PrintStream fout = UTOutput.createPrintBufferedFileStream(args[1]);
    CTTree tree;
    CTNode root;
    int count;
   
    while ((tree = reader.nextTree()) != null)
    {
      root = tree.getRoot();
     
      if (root.getChildrenSize() == 1)
      {
        count = stripPunct(tree);
       
        if (root.getChildrenSize() > 0 && tree.getTokens().size()-count >= 4 && !containsEmptyCategories(tree) && isCKYTree(root.getChild(0)))
          fout.println(tree+"\n");
      }
    }
   
    reader.close();
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
  }
 
  /** Called by {@link EnglishC2DConverter#mapEmtpyCategories(CTTree)}. */
  private void mapPRO(CTTree cTree, CTNode ec)
  {
    CTNode np = ec.getParent();
    CTNode vp = np.getParent().getFirstChainedDescendant(CTLibEn.PTAG_VP);
   
    if (vp == null)                // small clauses
      relocatePRD(np, ec);
    else
    {
      CTNode ante;
     
      if ((ante = ec.getAntecedent()) != null && ante.pTag.startsWith("WH"))  // relative clauses
      {
        if (cTree.getCoIndexedEmptyCategories(ante.coIndex).size() == 1)
          mapTrace(cTree, ec);
View Full Code Here
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
  }
 
  /** Called by {@link EnglishC2DConverter#mapEmtpyCategories(CTTree)}. */
  private void mapTrace(CTTree cTree, CTNode ec)
  {
    CTNode ante = ec.getAntecedent();
   
    if (ante == null || ec.isDescendantOf(ante))
      removeCTNode(ec);
    else if (ante.hasFTag(CTLibEn.FTAG_TPC))
    {
      if (!ante.hasFTag(CTLibEn.FTAG_SBJ))
      {
        CTNode parent = ec.getParent();
        parent.removeChild(ec);
        replaceEC(parent, ante);
      }
      else
        removeCTNode(ec);
    }
    else  // relative clauses
    {
      CTNode parent = ante.getHighestChainedAncestor(CTLibEn.PTAG_SBAR);
      if (parent != null)    parent.addFTag(DEPLibEn.DEP_RCMOD);
      replaceEC(ec, ante);
    }
  }
View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
  }
 
  /** Called by {@link EnglishC2DConverter#mapEmtpyCategories(CTTree)}. */
  private void mapNull(CTTree cTree, CTNode ec)
  {
    CTNode np = ec.getParent();
   
    if (np.hasFTag(CTLibEn.FTAG_SBJ))
    {
      // small clauses
      if (np.getNextSibling(CTLibEn.PTAG_VP) == null)
        relocatePRD(np, ec);
      else
        addXSubject(ec, m_xsbj);
    }
  }
View Full Code Here
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
  }
 
  /** Called by {@link EnglishC2DConverter#mapEmtpyCategories(CTTree)}. */
  private void mapICH(CTTree cTree, CTNode ec)
  {
    CTNode parent = ec.getParent();
    CTNode ante   = ec.getAntecedent();
   
    if (ec.form.startsWith(CTLibEn.EC_ICH) && parent.getPrevSibling("+WH.*") != null)
      removeCTNode(ec);
    else if (ante == null || ec.isDescendantOf(ante))
      removeCTNode(ec);
    else
    {
      List<CTNode> list = cTree.getCoIndexedEmptyCategories(ante.coIndex);
      boolean isRNR = ec.form.startsWith(CTLibEn.EC_RNR);
      int i, size = list.size();
      CTNode node;
     
      Deque<CTNode> dq = isRNR ? new ArrayDeque<CTNode>() : null;
     
      if (ec.getTerminalId() < ante.getFirstTerminal().getTerminalId())
      {   
        for (i=0; i<size-1; i++)
        {
          node = list.get(i);
          if (isRNR)  dq.addLast(node.getParent().getParent());
          removeCTNode(node);
        }
       
        ec = list.get(size-1);
      }
      else
      {
        for (i=size-1; i>0; i--)
        {
          node = list.get(i);
          if (isRNR)  dq.addFirst(node.getParent().getParent());
          removeCTNode(node);
        }
       
        ec = list.get(0);
      }
View Full Code Here
325
326
327
328
329
330
331
332
333
334
335
336
  }
 
  /** Called by {@link EnglishC2DConverter#mapPRO(CTTree, CTNode)} and {@link EnglishC2DConverter#mapNull(CTTree, CTNode)}. */
  private void relocatePRD(CTNode np, CTNode ec)
  {
    CTNode s   = np.getParent();
    CTNode prd = s.getFirstChild("-"+CTLibEn.FTAG_PRD);
    Set<String> fTags = s.getFTags();
   
    if (prd != null && (fTags.isEmpty() || fTags.contains(CTLibEn.FTAG_CLR)))
    {
      fTags.clear();
View Full Code Here
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
   * @param ec empty subject.
   * @param map key: antecedent, value: list of clauses containing empty subjects.
   */
  private void addXSubject(CTNode ec, Map<CTNode, Deque<CTNode>> map)
  {
    CTNode ante = ec.getAntecedent();
   
    while (ante != null && ante.isEmptyCategoryRec() && !ante.pTag.startsWith("WH"))
      ante = ante.getFirstTerminal().getAntecedent();
   
    if (ante != null)
    {
      CTNode s = ec.getNearestAncestor(CTLibEn.PTAG_S);
     
      if (s != null)
      {
        Deque<CTNode> dq = map.get(ante);
        if (dq == null)  dq = new ArrayDeque<CTNode>();
View Full Code Here
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
    }
  }
 
  private void removeCTNode(CTNode node)
  {
    CTNode parent = node.getParent();
 
    if (parent != null)
    {
      parent.removeChild(node);
     
      if (parent.getChildrenSize() == 0)
        removeCTNode(parent);     
    }
  }
View Full Code Here
408
409
410
411
412
413
414
415
416
   
    findHyphens(curr);
    findHeadsApposition(curr);
    findHeadsSmallClause(curr);

    CTNode head = getHead(rule, curr.getChildren(), SIZE_HEAD_FLAGS);
    if (head.c2d.getLabel() != null)  head.c2d.setLabel(null);
    curr.c2d = new C2DInfo(head);
  }
View Full Code Here
TOP

Related Classes of com.clearnlp.constituent.CTNode

  • com.carrotsearch.hppc.IntArrayList
  • com.carrotsearch.hppc.IntOpenHashSet
  • com.clearnlp.conversion.AbstractC2DConverter
  • com.clearnlp.conversion.EnglishC2DConverter
  • com.clearnlp.conversion.KaistC2DConverter
  • com.clearnlp.experiment.GenerateOntoNotesCoref
  • com.clearnlp.experiment.Tmp
  • com.clearnlp.run.C2DConvertMulti
  • com.clearnlp.run.PBPostProcess
  • java.util.StringTokenizer
    • 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.