本文整理汇总了Java中edu.stanford.nlp.trees.Tree.deepCopy方法的典型用法代码示例。如果您正苦于以下问题：Java Tree.deepCopy方法的具体用法？Java Tree.deepCopy怎么用？Java Tree.deepCopy使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类edu.stanford.nlp.trees.Tree的用法示例。
在下文中一共展示了Tree.deepCopy方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: getMinimalConnectedStructure
import edu.stanford.nlp.trees.Tree; //导入方法依赖的package包/类
public static Tree getMinimalConnectedStructure(Tree tree, Tree firstLeaf, Tree lastLeaf, int lastLeafIndex)
{
// find common ancestor node by traversing the tree bottom-up from the last leaf and up
Tree commonAncestorNode = lastLeaf.parent(tree);
while(!commonAncestorNode.getLeaves().get(0).equals(firstLeaf))
{
commonAncestorNode = commonAncestorNode.parent(tree);
}
// found the common ancestor, now we need to clone the tree and chop the children non-terminals the span of which is outwith the last leaf
Tree result = commonAncestorNode.deepCopy();
List<Tree> leaves = result.getLeaves();
lastLeaf = leaves.get(lastLeafIndex);
Tree p = lastLeaf.parent(result);
Tree d = lastLeaf;
while(p != null)
{
if(p.numChildren() > 1)
{
// remove siblings to the right of d
int index = indexOfChild(p, d.nodeNumber(result), result);
pruneChildrenAfter(p, index);
}
d = p;
p = p.parent(result);
}
return result;
}