Package com.clearnlp.dependency

Examples of com.clearnlp.dependency.DEPTree


    reader.open(UTInput.createBufferedFileReader(inputFile));
    PrintStream fout = UTOutput.createPrintBufferedFileStream(outputFile);
    Prob2DMap map = new Prob2DMap();
    DEPNode node, head;
    String deprel, label, ftags;
    DEPTree tree;
    int i, size;
   
    while ((tree = reader.next()) != null)
    {
      size = tree.size();
     
      for (i=1; i<size; i++)
      {
        node   = tree.get(i);
        head   = node.getHead();
        deprel = node.getLabel();
        if ((ftags = node.getFeat(DEPLib.FEAT_SEM)) != null)
          deprel = ftags;
       
View Full Code Here


 
  public void countSemanticDependents(String[] args)
  {
    SRLReader reader = new SRLReader(0, 1, 2, 3, 4, 5, 6, 8);
    reader.open(UTInput.createBufferedFileReader(args[0]));
    DEPTree tree;
    DEPNode node, dHead, sHead;
    int i;
   
    while ((tree = reader.next()) != null)
    {
      tree.setDependents();
     
      for (i=1; i<tree.size(); i++)
      {
        node  = tree.get(i);
        dHead = node.getHead();
       
        for (DEPArc sArc : node.getSHeads())
        {
          sHead = sArc.getNode();
        //  sHead = sArc.getNode().getHead();
         
          if (sHead != dHead && sHead != dHead.getHead() && node.isDescendentOf(sHead))
          {
            System.out.println(node.id+" "+sArc.getNode().id+" "+tree.toStringSRL());
            try {System.in.read();} catch (IOException e) {e.printStackTrace();}
          }
        }
      }
    }
View Full Code Here

  @Override
  protected void postLabel(SRLState state)
  {
    if (isDecode())
    {
      DEPTree tree = state.getTree();
      List<List<DEPArc>> argLists = DEPLibEn.postLabel(tree);
      postLabelReferent(tree, argLists);
    }
  }
View Full Code Here

 
  // ============================= Get a dependency tree =============================
 
  private DEPTree getDEPTree(CTTree cTree)
  {
    DEPTree dTree = initDEPTree(cTree);
    addDEPHeads(dTree, cTree);
   
    if (dTree.containsCycle())
      System.err.println("Error: cyclic dependencies exist");
   
    splitLabels(dTree);
    addXHeads(dTree);
    addFeats(dTree, cTree, cTree.getRoot());
View Full Code Here

  }
 
  /** @return the dependency tree converted from the specific constituent tree without head information. */
  protected DEPTree initDEPTree(CTTree cTree)
  {
    DEPTree dTree = new DEPTree();
    String form, lemma, pos;
    DEPNode dNode;
    int id;
   
    for (CTNode node : cTree.getTokens())
    {
      id    = node.getTokenId() + 1;
      form  = PTPunct.revertBracket(node.form);
      lemma = AbstractColumnReader.BLANK_COLUMN;
      pos   = node.pTag;
     
      dNode = new DEPNode(id, form, lemma, pos, node.c2d.d_feats);
      dTree.add(dNode);
    }
   
    dTree.initXHeads();
    return dTree;
  }
View Full Code Here

   
  // ============================= Get a dependency tree =============================
 
  private DEPTree getDEPTree(CTTree cTree)
  {
    DEPTree dTree = initDEPTree(cTree);
    addDEPHeads(dTree, cTree);
   
    if (dTree.containsCycle())
      System.err.println("Error: cyclic dependencies exist");
   
    return dTree;
  }
View Full Code Here

  }
 
  @Override
  public DEPTree next()
  {
    DEPTree tree = null;
   
    try
    {
      List<String[]> lines = readLines();
      if (lines == nullreturn null;
     
      tree = getDEPTree(lines);
      tree.initSHeads();
      if (i_sheads >= 0setSHeads(lines, tree);
    }
    catch (Exception e) {e.printStackTrace();}
   
    return tree;
View Full Code Here

  }
 
  @Override
  public DEPTree next()
  {
    DEPTree tree = null;
   
    try
    {
      List<String[]> lines = readLines();
      if (lines == nullreturn null;
View Full Code Here

  protected DEPTree getDEPTree(List<String[]> lines)
  {
    String form, lemma, pos, feats, nament;
    int id, i, size = lines.size();
    DEPTree tree = new DEPTree();
    DEPNode node;
    String[] tmp;
   
    // initialize place holders
    for (i=0; i<size; i++)
      tree.add(new DEPNode());
   
    if (i_xheads >= 0)
      tree.get(0).setXHeads(new ArrayList<DEPArc>());
   
    if (i_sheads >= 0)
      tree.get(0).setXHeads(new ArrayList<DEPArc>());
   
    for (i=0; i<size; i++)
    {
      tmp    = lines.get(i);
      form   = tmp[i_form];
      id     = (i_id     < 0) ? i+: Integer.parseInt(tmp[i_id]);
      lemma  = (i_lemma  < 0) ? null : tmp[i_lemma];
      pos    = (i_pos    < 0) ? null : tmp[i_pos];
      feats  = (i_feats  < 0) ? AbstractColumnReader.BLANK_COLUMN : tmp[i_feats];
      nament = (i_nament < 0) ? null : tmp[i_nament];

      node = tree.get(id);
      node.init(id, form, lemma, pos, new DEPFeat(feats));
      node.nament = nament;
     
      if (i_headId >= 0 && !tmp[i_headId].equals(AbstractColumnReader.BLANK_COLUMN))
        node.setHead(tree.get(Integer.parseInt(tmp[i_headId])), tmp[i_deprel]);
     
      if (i_xheads >= 0)
        node.setXHeads(getXHeads(tree, tmp[i_xheads]));
     
      if (i_sheads >= 0)
        node.setSHeads(getSHeads(tree, tmp[i_sheads]));
     
      if (i_gpos >= 0)
        node.addFeat(DEPLib.FEAT_GPOS, tmp[i_gpos]);
    }
   
    if (i_coref >= 0) tree.setMentions(getMentions(lines));
    return tree;
  }
View Full Code Here

  }
 
  @Override
  public DEPTree next()
  {
    DEPTree tree = null;
   
    try
    {
      List<String[]> lines = readLines();
      if (lines == nullreturn null;
View Full Code Here

TOP

Related Classes of com.clearnlp.dependency.DEPTree

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.