Examples of com.clearnlp.reader.DEPReader

com.clearnlp.reader.DEPReader
@since 1.0.0 @author Jinho D. Choi ({@code jdchoi77@gmail.com})

//    return (build.length() == 0) ? "_" : build.substring(1);
  }
  
  public void countDEP(String[] args) throws Exception
  {
    DEPReader reader = new DEPReader(0, 1, 2, 3, 4, 6, 7);
    reader.open(UTInput.createBufferedFileReader(args[0]));
    Prob1DMap map = new Prob1DMap();
    int[] count = {0, 0};
    DEPTree tree;
    
    while ((tree = reader.next()) != null)
      countDEP(tree, count, map);
    
    reader.close();
    System.out.printf("%5.2f (%d/%d)\n", 100d*count[0]/count[1], count[0], count[1]);
    for (StringIntPair p : map.toSortedList())
      System.out.println(p.s+" "+p.i);
  }

View Full Code Here

    }
  }
  
  public void unknownWords(String[] args) throws Exception
  {
    DEPReader reader = new DEPReader(0, 1, 2, 3, 5, 6, 7);
    Set<String> set = Sets.newHashSet();
    String trainPath = args[0];
    String testPath  = args[1];
    PrintStream fout = UTOutput.createPrintBufferedFileStream(args[2]);
    DEPTree tree;
    int i, size;
    String str;
    
    for (String filename : UTFile.getInputFileList(trainPath, ".*.std"))
    {
      reader.open(UTInput.createBufferedFileReader(filename));
      
      while ((tree = reader.next()) != null)
      {
        size = tree.size();
        
        for (i=1; i<size; i++)
        {
          str = MPLib.simplifyBasic(tree.get(i).form);
          set.add(str);
        }
      }
      
      reader.close();
    }
    
    for (String filename : UTFile.getInputFileList(testPath, ".*.std"))
    {
      reader.open(UTInput.createBufferedFileReader(filename));
      
      while ((tree = reader.next()) != null)
      {
        size = tree.size();
        
        for (i=1; i<size; i++)
        {
          str = MPLib.simplifyBasic(tree.get(i).form);
          
          if (!set.contains(str))
          {
            fout.println(i);
            fout.println(tree.toStringDEP()+"\n");
            break;
          }
        }
      }
      
      reader.close();
    }
    
    fout.close();
  }

View Full Code Here

    reader.close();  
  }
  
  void getVerbForms(String[] args)
  {
    DEPReader fin = new DEPReader(0, 1, 2, 3, 4, 5, 6);
    fin.open(UTInput.createBufferedFileReader(args[0]));
    Set<String> keys = new TreeSet<String>();
    Prob2DMap mVBD = new Prob2DMap();
    Prob2DMap mVBN = new Prob2DMap();
    String form, base, past, part;
    int i, size, cutoff = 1;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = fin.next()) != null)
    {
      size = tree.size();
      
      for (i=1; i<size; i++)
      {

View Full Code Here

  }
  
  void countLR(String inputFile)
  {
  //  DEPReader reader = new DEPReader(0, 1, 2, 3, 5, 6, 7);
    DEPReader reader = new DEPReader(0, 1, 2, 4, 6, 8, 10);
    reader.open(UTInput.createBufferedFileReader(inputFile));
    int i, size, left = 0, right = 0, l, r, prevId, depId;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = reader.next()) != null)
    {
      tree.setDependents();
      size = tree.size();
      
      for (i=1; i<size; i++)
      {
        node = tree.get(i);
        prevId = -1;
        l = r = 0;
        
        for (DEPArc arc : node.getDependents())
        {
          depId = arc.getNode().id;
          
          if (depId - prevId == 1)
          {
            if (depId < node.id)  l++;
            else           r++;
          }
          
          prevId = depId;
        }
        
        if      (l > 1)  left++;
        else if (r > 1)  right++;
      }
    }
    
    reader.close();
    System.out.printf("Left: %d, Right: %d\n", left, right);
  }

View Full Code Here

    System.out.printf("%5.2f (%d/%d)\n", 100d*correct/total, correct, total);
  }
  
  void projectivize(String inputFile, String outputFile)
  {
    DEPReader reader = new DEPReader(0, 1, 2, 4, 6, 8, 10);
    DEPTree tree;
    
    reader.open(UTInput.createBufferedFileReader(inputFile));
    PrintStream fold = UTOutput.createPrintBufferedFileStream(outputFile+".old");
    PrintStream fnew = UTOutput.createPrintBufferedFileStream(outputFile+".new");
    int i;
    
    for (i=0; (tree = reader.next()) != null; i++)
    {
      fold.println(tree.toStringCoNLL()+"\n");
      tree.projectivize();
      fnew.println(tree.toStringCoNLL()+"\n");
      
      if (i%1000 == 0)  System.out.print(".");
    }  System.out.println();
    
    reader.close();
    fold.close();
    fnew.close();
  }

View Full Code Here

    reader.close();  
  }
  
  void getVerbForms(String[] args)
  {
    DEPReader fin = new DEPReader(0, 1, 2, 3, 4, 5, 6);
    fin.open(UTInput.createBufferedFileReader(args[0]));
    Set<String> keys = new TreeSet<String>();
    Prob2DMap mVBD = new Prob2DMap();
    Prob2DMap mVBN = new Prob2DMap();
    String form, base, past, part;
    int i, size, cutoff = 1;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = fin.next()) != null)
    {
      size = tree.size();
      
      for (i=1; i<size; i++)
      {

View Full Code Here

  }
  
  void countLR(String inputFile)
  {
  //  DEPReader reader = new DEPReader(0, 1, 2, 3, 5, 6, 7);
    DEPReader reader = new DEPReader(0, 1, 2, 4, 6, 8, 10);
    reader.open(UTInput.createBufferedFileReader(inputFile));
    int i, size, left = 0, right = 0, l, r, prevId, depId;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = reader.next()) != null)
    {
      tree.setDependents();
      size = tree.size();
      
      for (i=1; i<size; i++)
      {
        node = tree.get(i);
        prevId = -1;
        l = r = 0;
        
        for (DEPArc arc : node.getDependents())
        {
          depId = arc.getNode().id;
          
          if (depId - prevId == 1)
          {
            if (depId < node.id)  l++;
            else           r++;
          }
          
          prevId = depId;
        }
        
        if      (l > 1)  left++;
        else if (r > 1)  right++;
      }
    }
    
    reader.close();
    System.out.printf("Left: %d, Right: %d\n", left, right);
  }

View Full Code Here

    System.out.printf("%5.2f (%d/%d)\n", 100d*correct/total, correct, total);
  }
  
  void projectivize(String inputFile, String outputFile)
  {
    DEPReader reader = new DEPReader(0, 1, 2, 4, 6, 8, 10);
    DEPTree tree;
    
    reader.open(UTInput.createBufferedFileReader(inputFile));
    PrintStream fold = UTOutput.createPrintBufferedFileStream(outputFile+".old");
    PrintStream fnew = UTOutput.createPrintBufferedFileStream(outputFile+".new");
    int i;
    
    for (i=0; (tree = reader.next()) != null; i++)
    {
      fold.println(tree.toStringCoNLL()+"\n");
      tree.projectivize();
      fnew.println(tree.toStringCoNLL()+"\n");
      
      if (i%1000 == 0)  System.out.print(".");
    }  System.out.println();
    
    reader.close();
    fold.close();
    fnew.close();
  }

View Full Code Here

    reader.close();  
  }
  
  void getVerbForms(String[] args)
  {
    DEPReader fin = new DEPReader(0, 1, 2, 3, 4, 5, 6);
    fin.open(UTInput.createBufferedFileReader(args[0]));
    Set<String> keys = new TreeSet<String>();
    Prob2DMap mVBD = new Prob2DMap();
    Prob2DMap mVBN = new Prob2DMap();
    String form, base, past, part;
    int i, size, cutoff = 1;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = fin.next()) != null)
    {
      size = tree.size();
      
      for (i=1; i<size; i++)
      {

View Full Code Here

  }
  
  void countLR(String inputFile)
  {
  //  DEPReader reader = new DEPReader(0, 1, 2, 3, 5, 6, 7);
    DEPReader reader = new DEPReader(0, 1, 2, 4, 6, 8, 10);
    reader.open(UTInput.createBufferedFileReader(inputFile));
    int i, size, left = 0, right = 0, l, r, prevId, depId;
    DEPTree tree;
    DEPNode node;
    
    while ((tree = reader.next()) != null)
    {
      tree.setDependents();
      size = tree.size();
      
      for (i=1; i<size; i++)
      {
        node = tree.get(i);
        prevId = -1;
        l = r = 0;
        
        for (DEPArc arc : node.getDependents())
        {
          depId = arc.getNode().id;
          
          if (depId - prevId == 1)
          {
            if (depId < node.id)  l++;
            else           r++;
          }
          
          prevId = depId;
        }
        
        if      (l > 1)  left++;
        else if (r > 1)  right++;
      }
    }
    
    reader.close();
    System.out.printf("Left: %d, Right: %d\n", left, right);
  }

View Full Code Here

0 1

TOP

Related Classes of com.clearnlp.reader.DEPReader

com.clearnlp.dependency.DEPFeat

com.clearnlp.dependency.DEPNode

com.clearnlp.dependency.DEPTree

com.clearnlp.experiment.DEPErrors

com.clearnlp.experiment.DEPSplit

com.clearnlp.experiment.Tmp

com.clearnlp.experiment.TopicAssigner

com.clearnlp.run.AbstractRun

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.