Examples of com.clearnlp.dependency.DEPNode

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


    SRLReader reader = new SRLReader(0, 1, 2, 3, 4, 5, 6, 8);
    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;
        
        for (DEPArc arc : node.getSHeads())
        {
          label = arc.getLabel();
        //  if (label.startsWith("R-AM"))
        //    label = label.substring(2);

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

  
//  ====================================== NODES ======================================
  
  public DEPNode getNode(FtrToken token)
  {
    DEPNode node = null;
    
    switch (token.source)
    {
    case JointFtrXml.S_STACK : node = getNodeStack(token);  break;
    case JointFtrXml.S_LAMBDA: node = getNode(token, i_lambda, 0, i_beta);  break;
    case JointFtrXml.S_BETA  : node = getNode(token, i_beta, i_lambda, t_size);  break;
    }
    
    if (node == null)  return null;
    
    if (token.relation != null)
    {
           if (token.isRelation(JointFtrXml.R_H))    node = node.getHead();
      else if (token.isRelation(JointFtrXml.R_H2))  node = node.getGrandHead();
      else if (token.isRelation(JointFtrXml.R_LMD))  node = d_tree.getLeftMostDependent  (node.id);
      else if (token.isRelation(JointFtrXml.R_RMD))  node = d_tree.getRightMostDependent (node.id);
      else if (token.isRelation(JointFtrXml.R_LMD2))  node = d_tree.getLeftMostDependent  (node.id, 1);
      else if (token.isRelation(JointFtrXml.R_RMD2))  node = d_tree.getRightMostDependent (node.id, 1);
      else if (token.isRelation(JointFtrXml.R_LNS))  node = d_tree.getLeftNearestSibling (node.id);

View Full Code Here

//  ====================================== POS TAGS ======================================
  
  public boolean resetPOSTags()
  {
    boolean reset = false;
    DEPNode node;
    int i;
    
    for (i=1; i<t_size; i++)
    {
      if (n_2ndPos[i] > 0)
      {
        reset = true;
        node = d_tree.get(i);
        node.pos = node.removeFeat(DEPLib.FEAT_POS2);
      }
    }
    
    return reset;
  }

View Full Code Here

  @Override
  protected void rerankPredictions(List<StringPrediction> ps, DEPState state)
  {
    if (!isDecode()) return;
    
    DEPNode lambda = state.getLambda();
    DEPNode beta   = state.getBeta();
    
    int i, size = ps.size(), count = 0;
    boolean lChanged, gChanged = false;
    StringPrediction prediction;
    DEPLabel label;

View Full Code Here

  
  private boolean rerankUnique(StringPrediction prediction, DEPLabel label, DEPNode head, Pattern p, int bIdx, int eIdx, DEPState state)
  {
    if (p.matcher(label.deprel).find())
    {
      DEPNode node;
      int i;
      
      for (i=bIdx; i<eIdx; i++)
      {
        node = state.getNode(i);
        
        if (node.isDependentOf(head) && p.matcher(node.getLabel()).find())
        {
          prediction.score = -1;
          return true;
        }
      }

View Full Code Here

    return false;
  }
  
  private int resetBeVerb(DEPState state)
  {
    DEPNode lambda = state.getLambda();
    DEPNode beta   = state.getBeta();
    
    if (isOutOfDomain(state, lambda, beta))
      return -1;
    
    DEPNode beVerb = lambda.getHead();
    
    if (!isAuxiliaryBe(state, beVerb, lambda, beta))
      return -1;
    
    String subj  = lambda.getLabel();
    int    vType = 0;
    
    if (beta.isPos(CTLibEn.POS_VBN))
      vType = 1;
    else if (beta.isPos(CTLibEn.POS_VBG))
      vType = 2;
    else if (beta.isPos(CTLibEn.POS_VBD))
    {
      String p2 = beta.getFeat(DEPLib.FEAT_POS2);
      if (p2 != null && p2.equals(CTLibEn.POS_VBN))  vType = 1;
    }
    
    // be - subj(lambda) -  vb[ng](beta)
    if (vType > 0 && (DEPLibEn.isSubject(subj) || (subj.equals(DEPLibEn.DEP_ATTR) && hasNoDependent(beVerb, 1, lambda.id, state) && hasNoDependent(beVerb, lambda.id+1, beta.id, state))))
    {
    //  System.out.println(beVerb.form+" "+lambda.id+" "+beta.id+"\n"+state.getTree().toStringDEP()+"\n");
      int i, size = beta.id;
      DEPNode node;
      
      for (i=beVerb.id+1; i<size; i++)
      {
        node = state.getNode(i);
        
        if (node.isDependentOf(beVerb))
          node.setHead(beta);
      }
      
      clearPreviousDependents(beVerb, state);
      beVerb.setHead(beta);

View Full Code Here

    return -1;
  }
  
  private boolean isOutOfDomain(DEPState state, DEPNode lambda, DEPNode beta)
  {
    DEPNode node;
    int i;
    
    for (i=beta.id-1; i>lambda.id; i--)
    {
      node = state.getNode(i);
      
      if (node.isDependentOf(beta) && (DEPLibEn.isSubject(node.getLabel()) || DEPLibEn.isAuxiliary(node.getLabel())))
        return true;
    }
    
    return false;
  }

View Full Code Here

  
  private boolean isAuxiliaryBe(DEPState state, DEPNode beVerb, DEPNode lambda, DEPNode beta)
  {
    if (beVerb != null && beVerb.isLemma(ENAux.BE) && beVerb.id < lambda.id && !beta.isDescendentOf(beVerb))
    {
      DEPNode prev = state.getNode(beVerb.id-1);
      if (prev != null && (prev.isLemma("here") || prev.isLemma("there"))) return false;
      
      DEPNode gHead = beVerb.getHead();
      return gHead == null || gHead.id < beVerb.id;
    }
    
    return false;
  }

View Full Code Here

    return false;
  }
  
  private boolean hasNoDependent(DEPNode head, int bIdx, int eIdx, DEPState state)
  {
    DEPNode node;
    int i;
    
    for (i=bIdx; i<eIdx; i++)
    {
      node = state.getNode(i);
      
      if (node.isDependentOf(head))
        return false;
    }
    
    return true;
  }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of com.clearnlp.dependency.DEPNode

com.carrotsearch.hppc.IntOpenHashSet

com.clearnlp.component.dep.AbstractDEPParser

com.clearnlp.component.dep.EnglishDEPParser

com.clearnlp.component.evaluation.DEPEval

com.clearnlp.component.evaluation.POSEval

com.clearnlp.component.evaluation.PredEval

com.clearnlp.component.evaluation.RoleEval

com.clearnlp.component.morph.AbstractMPAnalyzer

com.clearnlp.component.online.OnlinePOSTagger

com.clearnlp.component.pos.AbstractPOSTagger

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.