Examples of edu.stanford.nlp.trees.Tree.removeChild()

edu.stanford.nlp.trees.Tree.removeChild()
Destructively removes the child at some daughter index and returns it. Note that this method will throw an {@link ArrayIndexOutOfBoundsException} ifthe daughter index is too big for the list of daughters. @param i The daughter index @return The tree at that daughter index

        Tree nodeToDelete = child.evaluate(tree, tregex);
        if (nodeToDelete == tree) {
          result = null;
        }
        Tree parent = nodeToDelete.parent(tree);
        parent.removeChild(Trees.objectEqualityIndexOf(parent,nodeToDelete));
      }
      return result;
    }
  }

View Full Code Here


  private static Tree pruneHelper(Tree root, Tree nodeToPrune) {
    if(nodeToPrune==root)
      return null;
    Tree parent = nodeToPrune.parent(root);
    parent.removeChild(Trees.objectEqualityIndexOf(parent,nodeToPrune));
    if(parent.children().length==0)
      return pruneHelper(root,parent);
    return root;
  }
}

View Full Code Here

      }
      Tree parent = topNode.parent(tree);
      if(Tsurgeon.verbose)
        System.err.println("Parent: " + parent);
      int i = Trees.objectEqualityIndexOf(parent,topNode);
      parent.removeChild(i);
      for(Tree child : bottomNode.children()) {
        parent.addChild(i,child);
        i++;
      }
      if(Tsurgeon.verbose)

View Full Code Here

        }
        return childMatcher[1].evaluate(tree, tregex);
      }
      Tree parent = oldNode.parent(tree);
      int i = parent.objectIndexOf(oldNode);
      parent.removeChild(i);
      for (int j = 1; j < children.length; ++j) {
        Tree newNode = childMatcher[j].evaluate(tree, tregex);
        parent.insertDtr(newNode.deepCopy(), i + j - 1);
      }
      return tree;

View Full Code Here


    @Override
    public Tree evaluate(Tree tree, TregexMatcher tregex) {
      Tree nodeToMove = childMatcher[0].evaluate(tree, tregex);
      Tree oldParent = nodeToMove.parent(tree);
      oldParent.removeChild(Trees.objectEqualityIndexOf(oldParent,nodeToMove));
      Pair<Tree,Integer> position = locationMatcher.evaluate(tree, tregex);
      position.first().insertDtr(nodeToMove,position.second());
      return tree;
    }
  }

View Full Code Here

      return null;
    Tree parent = topNode.parent(t);
    if(Tsurgeon.verbose)
      System.err.println("Parent: " + parent);
    int i = Trees.objectEqualityIndexOf(parent,topNode);
    parent.removeChild(i);
    for(Tree child : bottomNode.children()) {
      parent.addChild(i,child);
      i++;
    }
    if(Tsurgeon.verbose)

View Full Code Here

    Tree newNode = children[1].evaluate(t,m);
    if(oldNode==t)
      return newNode;
    Tree parent = oldNode.parent(t);
    int i = parent.indexOf(oldNode);
    parent.removeChild(i);
    parent.insertDtr(newNode,i);
    return t;
  }
}

View Full Code Here


  @Override
  public Tree evaluate(Tree t, TregexMatcher m) {
    Tree nodeToMove = children[0].evaluate(t,m);
    Tree oldParent = nodeToMove.parent(t);
    oldParent.removeChild(Trees.objectEqualityIndexOf(oldParent,nodeToMove));
    Pair<Tree,Integer> position = l.evaluate(t,m);
    position.first().insertDtr(nodeToMove,position.second());
    return t;
  }

View Full Code Here

      Tree nodeToDelete = child.evaluate(t, m);
      if (nodeToDelete == t) {
        result = null;
      }
      Tree parent = nodeToDelete.parent(t);
      parent.removeChild(Trees.objectEqualityIndexOf(parent,nodeToDelete));
    }
    return result;
  }


}

View Full Code Here


  private static Tree pruneHelper(Tree root, Tree nodeToPrune) {
    if(nodeToPrune==root)
      return null;
    Tree parent = nodeToPrune.parent(root);
    parent.removeChild(Trees.objectEqualityIndexOf(parent,nodeToPrune));
    if(parent.children().length==0)
      return pruneHelper(root,parent);
    return root;
  }
}

View Full Code Here

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.