Examples of DepNode

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

Examples of com.clearnlp.dependency.DEPNode

    count[1] += size - 1;
  }
  
  private boolean isConstDEP(DEPTree tree, int currId)
  {
    DEPNode curr = tree.get(currId);
    DEPNode head = curr.getHead();
    DEPNode node;
    
    if (curr.id > head.id)  return false;
    int i;
    
    for (i=curr.id+1; i<head.id; i++)
    {
      node = tree.get(i);
      
      if (!node.isDependentOf(head))
        return false;
    }
    
    return true;
  }

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

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

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

  
  void findNonHeadsAux(DEPTree tree, Prob2DMap map)
  {
    int i, size = tree.size();
    tree.setDependents();
    DEPNode node;
    String yn;
    
    for (i=1; i<size; i++)
    {
      node = tree.get(i);
      yn = node.getDependentNodeList().isEmpty() ? "N" : "Y";
      map.add(node.getLabel(), yn);
    }
  }

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

  }
  
  void extractVerbPPAux(DEPTree tree, Prob2DMap map)
  {
    int i, size = tree.size();
    DEPNode verb;
    SRLArc arc;
    
    tree.setDependents();
    
    for (i=1; i<size; i++)
    {
      verb = tree.get(i);
      
      if (MPLibEn.isVerb(verb.pos))
      {
        for (DEPNode arg : verb.getDependentNodeList())
        {
          if (!arg.isLabel(DEPLibEn.DEP_AGENT) && (arc = arg.getSHead(verb)) != null)
          {
            if (arg.isPos(CTLibEn.POS_IN) && PBLib.isCoreNumberedArgument(arc.getLabel()))
              map.add(verb.lemma, arg.lemma);

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

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

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

    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))
        {
          if (!form.equals(past))
            mVBD.add(base, form);
        }
        else if (node.isPos(CTLibEn.POS_VBN))
        {
          if (!form.equals(past))
            mVBN.add(base, form);
        }
      }

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

  }
  
  void checkPosDeprel(DEPTree tree, Prob2DMap mc, Prob2DMap mh)
  {
    int i, size = tree.size();
    DEPNode node, head;
    String deprel;
    
    for (i=1; i<size; i++)
    {
      node = tree.get(i);
      head = node.getHead();
      deprel = node.getLabel();


      mc.add(deprel, MPLibEn.toCPOSTag(node.pos));
      mh.add(deprel, MPLibEn.toCPOSTag(head.pos));
    }
  }

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

  }
  
  void classifySentenceType(DEPTree tree, IntIntPair count)
  {
    int i, size = tree.size();
    DEPNode node;
    String  feat;
    
    tree.setDependents();
    
    for (i=1; i<size; i++)
    {
      node = tree.get(i);
      feat = node.getFeat(DEPLib.FEAT_SNT);
      
      if (node.pos.startsWith("VB"))
      {
        if (isImperative(node))
        {
          count.i1++;
          
          if (feat == null || !feat.equals("IMP"))
          {
            if (node.isLemma("be"))
              System.out.println(node.id+" "+tree.toStringDEP()+"\n");
            count.i2++;
          }
        }
      }

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

    if (verb.isLabel(DEPLibEn.DEP_AUX) || verb.isLabel(DEPLibEn.DEP_AUXPASS) || verb.isLabel(DEPLibEn.DEP_XCOMP) || verb.isLabel(DEPLibEn.DEP_PARTMOD) || verb.isLabel(DEPLibEn.DEP_RCMOD) || verb.isLabel(DEPLibEn.DEP_CONJ) || verb.isLabel(DEPLibEn.DEP_HMOD))
      return false;


    List<DEPArc> deps = verb.getDependents();
    int i, size = deps.size();
    DEPNode node;
    DEPArc  dep;
    
    for (i=0; i<size; i++)
    {
      dep  = deps.get(i);
      node = dep.getNode();
      
      if (node.id < verb.id)
      {
        if (dep.isLabel(DEPLibEn.DEP_COMPLM) || dep.isLabel(DEPLibEn.DEP_MARK))
          return false;
        
        if (dep.isLabel(P_AUX) && !node.isLemma("do"))
          return false;
        
        if (node.isPos(CTLibEn.POS_TO) || node.isPos(CTLibEn.POS_MD) || node.pos.startsWith("W"))
          return false;  
      }
      
      if (dep.isLabel(P_SBJ) || dep.isLabel(DEPLibEn.DEP_EXPL))
        return false;

View Full Code Here

Examples of com.clearnlp.dependency.DEPNode

  }
  
  /** Called by {@link #process(DEPTree)}. */
  private void processCollect(TagState state)
  {
    DEPNode input = state.getInput();
    
    if (s_lsfs.contains(input.lowerSimplifiedForm))
      p_ambi.add(input.simplifiedForm, input.pos);
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.