Package com.clearnlp.constituent

Examples of com.clearnlp.constituent.CTTree

1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
 
  void splitTrees(String[] args)
  {
    CTReader reader = new CTReader(UTInput.createBufferedFileReader(args[0]));
    PrintStream[] fout = new PrintStream[4];
    CTTree tree;
    int i, j;
   
    fout[0] = UTOutput.createPrintBufferedFileStream(args[0]+".trn.parse");
    fout[1] = UTOutput.createPrintBufferedFileStream(args[0]+".trn.raw");
    fout[2] = UTOutput.createPrintBufferedFileStream(args[0]+".tst.parse");
    fout[3] = UTOutput.createPrintBufferedFileStream(args[0]+".tst.raw");
   
    for (i=0; (tree = reader.nextTree()) != null; i++)
    {
      j = (i%6 == 0) ? 2 : 0;
     
      fout[j]  .println(tree.toString()+"\n");
      fout[j+1].println(tree.toForms());
    }
   
    for (PrintStream f : fout)  f.close();
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
    String treeDir = args[0];
    String treeFile = args[1];
    int treeId = Integer.parseInt(args[2]);
   
    CTReader reader = new CTReader(UTInput.createBufferedFileReader(treeDir+File.separator+treeFile));
    CTTree tree = null;
    int i;
   
    for (i=0; i<=treeId; i++)
      tree = reader.nextTree();
   
    System.out.println(tree.toString(true,true));
  }
View Full Code Here
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
 
  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
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
  }
 
  void traverse(String inputFile)
  {
    CTReader reader = new CTReader(UTInput.createBufferedFileReader(inputFile));
    CTTree tree;
   
    while ((tree = reader.nextTree()) != null)
      traverseAux(tree.getRoot());
  }
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
      }
      catch (Exception e) {e.printStackTrace();}
     
      PrintStream fout = UTOutput.createPrintBufferedFileStream(UTFile.replaceExtension(inputPath, outputExt));
      CTReader reader = new CTReader(UTInput.createBufferedFileReader(inputPath));
      CTTree cTree; DEPTree dTree; int n;
      List<PBInstance> instances = null;
     
      for (n=0; (cTree = reader.nextTree()) != null; n++)
      {
        if (language.equals(AbstractReader.LANG_EN))
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
 
  protected int convert(AbstractC2DConverter c2d, AbstractComponent morph, String language, String inputFile, String outputFile, boolean normalize)
  {
    CTReader  reader = new CTReader(UTInput.createBufferedFileReader(inputFile));
    PrintStream fout = UTOutput.createPrintBufferedFileStream(outputFile);
    CTTree  cTree;
    DEPTree dTree;
    int n;
   
    for (n=0; (cTree = reader.nextTree()) != null; n++)
    {
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
  public void postProcess(String propFile, String postFile, String treeDir, boolean norm, String language)
  {
    List<PBInstance> instances = PBLib.getPBInstanceList(propFile, treeDir, norm);
    List<PBInstance> remove = new ArrayList<PBInstance>();
    mergeLightVerbs(instances);
    CTTree tree;
    PBArg  aDSP;
   
    for (PBInstance instance : instances)
    {
      System.out.println(instance.getKey());
View Full Code Here
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
  }
 
  /** Returns {@code true} if the specific instance includes arguments misaligned to the constituent tree. */
  private boolean findMisalignedArgs(PBInstance instance)
  {
    CTTree tree  = instance.getTree();
    String label = null;
   
    if (!tree.isRange(instance.predId, 0) ||
      (instance.isVerbPredicate() && !tree.getTerminal(instance.predId).pTag.startsWith("VB")) ||
      (instance.isNounPredicate() && !tree.getTerminal(instance.predId).pTag.startsWith("NN")))
    {
      label = PBLib.PB_REL;
    }
    else
    {
      outer: for (PBArg arg : instance.getArgs())
      {
        for (PBLoc loc : arg.getLocs())
        {
          if (!tree.isRange(loc))
          {
            label = arg.label;
            break outer;
          }
         
View Full Code Here
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
317
318
319
   * PRE: {@link PBInstance#sortArgs()} is called.
   */
  private void joinConcatenations(PBInstance instance)
  {
    SortedIntArrayList ids = new SortedIntArrayList();
    CTTree tree = instance.getTree();
    int terminalId, height;
    CTNode node, parent;
    List<PBLoc> lNew;
   
    for (PBArg arg : instance.getArgs())
    {
      if (arg.isLabel(PBLib.PB_REL))  continue;
      ids.clear();
     
      for (PBLoc loc : arg.getLocs())
      {
        if (!loc.isType("") && !loc.isType(","))  return;
        if (loc.height > 0)              return;
        ids.add(loc.terminalId);
      }
     
      lNew = new ArrayList<PBLoc>();
     
      while (!ids.isEmpty())
      {
        terminalId = ids.get(0);
        height     = 0;
        node       = tree.getNode(terminalId, height);
       
        while ((parent = node.getParent()) != null && !parent.isPTag(CTLib.PTAG_TOP) && UTHppc.isSubset(ids, parent.getSubTerminalIdSet()))
        {
          node = parent;
          height++;
View Full Code Here
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
   * Fixes locations cyclic to its predicate.
   * PRE: {@link PBInstance#sortArgs()} is called.
   */
  private void fixCyclicLocs(PBInstance instance)
  {
    CTTree  tree  = instance.getTree();
    int    predId = instance.predId;
    boolean isCyc = false;
    CTNode  node, tmp;
   
    StringBuilder build = new StringBuilder();
    build.append(ERR_CYCLIC);
   
    for (PBArg arg : instance.getArgs())
    {
      if (arg.isLabel(PBLib.PB_REL))  continue;
     
      for (PBLoc loc : arg.getLocs())
      {
        if ((node = tree.getNode(loc)).getSubTerminalIdSet().contains(predId))
        {
          if (arg.isLabel(PBLib.PB_ARGM_MOD))
            loc.height = 0;
          else if (arg.isLabel(PBLib.PB_LINK_SLC) && node.isPTag(CTLibEn.PTAG_SBAR) && (tmp = node.getFirstChild("+WH.*")) != null)
            loc.set(tmp.getPBLoc(), loc.type);
View Full Code Here
TOP

Related Classes of com.clearnlp.constituent.CTTree

  • com.clearnlp.demo.Demo
  • com.clearnlp.experiment.CompareCTTrees
  • com.clearnlp.experiment.CT2POS
  • com.clearnlp.experiment.GenerateOntoNotesCoref
  • com.clearnlp.experiment.GeneratePOS
  • com.clearnlp.experiment.PBExtract
  • com.clearnlp.experiment.PrintTreeLine
  • com.clearnlp.experiment.RemoveEdited
  • com.clearnlp.experiment.SemlinkToOntoNotes
  • com.clearnlp.experiment.Tmp
    • 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.