Examples of com.clearnlp.dependency.DEPTree

com.clearnlp.dependency.DEPTree
google.com/p/clearnlp/source/browse/trunk/src/edu/colorado/clear/test/dependency/DPTreeTest.java">DPTreeTest for the use of this class. @see DEPNode @since v0.1 @author Jinho D. Choi ({@code jdchoi77@gmail.com})

  private Set<String> getLowerSimplifiedFormsByDocumentFrequencies(JointReader reader, String[] filenames, int devId, int cutoff)
  {
    int i, j, len, size = filenames.length;
    Set<String> set = Sets.newHashSet();
    Prob1DMap map = new Prob1DMap();
    DEPTree tree;
    
    LOG.info(String.format("Collecting simplified-forms: cutoff = %d\n", cutoff));
    
    for (i=0; i<size; i++)
    {
      if (i == devId)  continue;
      reader.open(UTInput.createBufferedFileReader(filenames[i]));
      set.clear();
      
      while ((tree = reader.next()) != null)
      {
        len = tree.size();
        
        for (j=1; j<len; j++)
          set.add(MPLib.getSimplifiedLowercaseWordForm(tree.get(j).form));
      }
      
      map.addAll(set);
      reader.close();
      LOG.info(".");

View Full Code Here

  private Set<String> getLowerSimplifiedFormsByDocumentFrequencies(JointReader reader, String[] filenames, int devId, int cutoff, int maxCount)
  {
    int i, j, len, count = 0, size = filenames.length;
    Set<String> set = Sets.newHashSet();
    Prob1DMap map = new Prob1DMap();
    DEPTree tree;
    
    LOG.info(String.format("Collecting simplified-forms: cutoff = %d, max = %d\n", cutoff, maxCount));
    
    for (i=0; i<size; i++)
    {
      if (i == devId)  continue;
      reader.open(UTInput.createBufferedFileReader(filenames[i]));
      
      while ((tree = reader.next()) != null)
      {
        len = tree.size();
        
        for (j=1; j<len; j++)
          set.add(MPLib.getSimplifiedLowercaseWordForm(tree.get(j).form));
        
        if ((count += len) >= maxCount)
        {
          map.addAll(set);
          LOG.info(".");

View Full Code Here

  }
  
  void generation(String[] args)
  {
    Pattern ignore = Pattern.compile("AM-MOD|AM-ADV|C-.+|R-.+");
    DEPTree tree = new DEPTree();
    
    tree.add(new DEPNode(1, "Tell"   , "tell" , "VB" , new DEPFeat()));
    tree.add(new DEPNode(2, "me"     , "me"   , "PRP", new DEPFeat()));
    tree.add(new DEPNode(3, "about"  , "about", "IN" , new DEPFeat()));
    tree.add(new DEPNode(4, "berries", "berry", "NNS", new DEPFeat()));


    tree.get(1).setHead(tree.get(0), DEPLibEn.DEP_ROOT);
    tree.get(2).setHead(tree.get(1), DEPLibEn.DEP_DOBJ);
    tree.get(3).setHead(tree.get(1), DEPLibEn.DEP_PREP);
    tree.get(4).setHead(tree.get(3), DEPLibEn.DEP_POBJ);
    
    tree.setDependents();
    tree.initSHeads();
    
    tree.get(1).addFeat(DEPLib.FEAT_PB, "tell.01");
    tree.get(2).addSHead(tree.get(1), "A2");
    tree.get(3).addSHead(tree.get(1), "A1");
    
    SRLTree sTree = tree.getSRLTree(1);
    System.out.println(sTree.getRichKeyEn(ignore, "."));
  }

View Full Code Here

  void extractVerbPP(String[] args)
  {
    SRLReader reader = new SRLReader(0, 1, 2, 3, 4, 5, 6, 8);
    reader.open(UTInput.createBufferedFileReader(args[0]));
    Prob2DMap map = new Prob2DMap();
    DEPTree tree;
    
    while ((tree = reader.next()) != null)
      extractVerbPPAux(tree, map);
    
    PrintStream fout = UTOutput.createPrintBufferedFileStream(args[1]);

View Full Code Here

    SRLReader reader = new SRLReader(0, 1, 2, 3, 4, 5, 6, 7);
    reader.open(UTInput.createBufferedFileReader(args[0]));
    PrintStream fout = UTOutput.createPrintBufferedFileStream(args[1]);
    Pattern p = UTRegex.getORPatternExact(DEPLibEn.DEP_COMPLM, DEPLibEn.DEP_MARK);
    DEPNode root, head;
    DEPTree tree;
    
    while ((tree = reader.next()) != null)
    {
      tree.setDependents();
      root = tree.getFirstRoot();
      head = root.getDependents().get(0).getNode();
      
      tree = new DEPTree();
      head.removeDependentsByLabels(p);
      
      for (DEPNode node : head.getSubNodeSortedList())
      {
        tree.add(node);
        if (node.isDependentOf(root))
          node.setHead(tree.get(0), DEPLibEn.DEP_ROOT);
      }
      
      tree.resetIDs();
      fout.println(tree.toStringSRL()+"\n");
    }
    
    fout.close();
    reader.close();  
  }

View Full Code Here

    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++)
      {
        node = tree.get(i);
        base = node.lemma;
        form = node.form.toLowerCase();
        past = LGVerbEn.getPastRegularForm(base);
        
        if (node.isPos(CTLibEn.POS_VBD))

View Full Code Here

    fin.open(UTInput.createBufferedFileReader(args[0]));
    PrintStream fold = UTOutput.createPrintBufferedFileStream(args[0]+".o");
    PrintStream fnew = UTOutput.createPrintBufferedFileStream(args[0]+".n");
  //  ObjectInputStream oin = new ObjectInputStream(new BufferedInputStream(new FileInputStream(args[1])));
  //  PBFrameset p = (PBFrameset)oin.readObject();
    DEPTree tree;
    
    while ((tree = fin.next()) != null)
    {
      fold.println(tree.toStringSRL()+"\n");
      DEPLibEn.postLabel(tree);
      fnew.println(tree.toStringSRL()+"\n");
    }
  }

View Full Code Here

    AbstractC2DConverter converter = new KaistC2DConverter(new HeadRuleMap(UTInput.createBufferedFileReader(args[0])));
    String[] inputFiles = UTFile.getSortedFileList(args[1], "ptb");
    String outputFile;
    PrintStream fout;
    CTReader reader;
    DEPTree dTree;
    CTTree cTree;
    
    for (String inputFile : inputFiles)
    {
      outputFile = UTFile.replaceExtension(inputFile, "dep");
      reader = new CTReader(UTInput.createBufferedFileReader(inputFile));
      fout = UTOutput.createPrintBufferedFileStream(outputFile);
      System.out.println(outputFile);
      
      while ((cTree = reader.nextTree()) != null)
      {
        dTree = converter.toDEPTree(cTree);
        fout.println(dTree.toStringDEP()+"\n");
      }
      
      reader.close();
      fout.close();
    }

View Full Code Here

  {
  //  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())
        {

View Full Code Here

  }
  
  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();

View Full Code Here

0 1 2 3 4 5 6 7 8

TOP

Related Classes of com.clearnlp.dependency.DEPTree

com.carrotsearch.hppc.IntArrayList

com.carrotsearch.hppc.IntOpenHashSet

com.clearnlp.bin.AbstractNLP

com.clearnlp.bin.NLPDevelop

com.clearnlp.component.online.OnlinePOSTagger

com.clearnlp.component.srl.EnglishSRLabeler

com.clearnlp.conversion.AbstractC2DConverter

com.clearnlp.conversion.EnglishC2DConverter

com.clearnlp.conversion.KaistC2DConverter

com.clearnlp.dependency.factory.DefaultDEPNodeDatumFactory

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.