本文整理匯總了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;
}