本文整理汇总了Java中edu.stanford.nlp.trees.Tree.removeChild方法的典型用法代码示例。如果您正苦于以下问题：Java Tree.removeChild方法的具体用法？Java Tree.removeChild怎么用？Java Tree.removeChild使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类edu.stanford.nlp.trees.Tree的用法示例。
在下文中一共展示了Tree.removeChild方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: removeEmptyNodes
import edu.stanford.nlp.trees.Tree; //导入方法依赖的package包/类
public static Tree removeEmptyNodes(Tree tree)
{
Tree[] children = tree.children();
for (int i = 0; i < children.length; i++)
{
Tree child = children[i];
// heuristic: all leaf nodes have a special anchor symbol '<>' in the end.
// If we don't find this, then we should remove the node.
if (child.numChildren() == 0 && !child.label().value().contains("<>"))
{
// System.out.println("node " + child);
tree.removeChild(i);
} else
{
removeEmptyNodes(child);
}
}
return tree;
}
示例2: pruneChildrenAfter
import edu.stanford.nlp.trees.Tree; //导入方法依赖的package包/类
public static void pruneChildrenAfter(Tree parent, int index)
{
int numOfChildren = parent.numChildren();
for(int i = index + 1; i < numOfChildren; i++)
{
parent.removeChild(index + 1);
}
}
示例3: removeSubtreesAfterWord
import edu.stanford.nlp.trees.Tree; //导入方法依赖的package包/类
public static String removeSubtreesAfterWord(String inputTree, int numOfLeaves)
{
Tree tree = Tree.valueOf(inputTree);
List<Tree> leaves = tree.getLeaves();
if(leaves.size() > numOfLeaves)
{
// find common ancestor between last valid leaf and extraneous leaf
Tree firstLeaf = leaves.get(numOfLeaves - 1);
Tree lastLeaf = leaves.get(leaves.size() - 1);
Tree commonAncestorNode = lastLeaf.parent(tree);
while(!commonAncestorNode.getLeaves().contains(firstLeaf))
{
commonAncestorNode = commonAncestorNode.parent(tree);
}
// found the common ancestor, now we need to chop the children nodes the span of which is outwith the last valid leaf
Tree p = lastLeaf.parent(tree);
while(p != commonAncestorNode)
{
int numOfChildren = p.numChildren();
for(int i = 0; i < numOfChildren; i++)
p.removeChild(0);
p = p.parent(tree);
}
// remove last leftover parent node of the invalid leaf
commonAncestorNode.removeChild(commonAncestorNode.numChildren() - 1);
return tree.toString();
}
else
{
return inputTree;
}
}