本文整理汇总了Python中nltk.parse.chart.TreeEdge.__init__方法的典型用法代码示例。如果您正苦于以下问题：Python TreeEdge.__init__方法的具体用法？Python TreeEdge.__init__怎么用？Python TreeEdge.__init__使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类nltk.parse.chart.TreeEdge的用法示例。
在下文中一共展示了TreeEdge.__init__方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: __init__
# 需要导入模块: from nltk.parse.chart import TreeEdge [as 别名]
# 或者: from nltk.parse.chart.TreeEdge import __init__ [as 别名]
def __init__(self, span, lhs, rhs, dot=0, bindings=None):
"""
Construct a new edge. If the edge is incomplete (i.e., if
``dot<len(rhs)``), then store the bindings as-is. If the edge
is complete (i.e., if ``dot==len(rhs)``), then apply the
bindings to all nonterminals in ``lhs`` and ``rhs``, and then
clear the bindings. See ``TreeEdge`` for a description of
the other arguments.
"""
if bindings is None: bindings = {}
# If the edge is complete, then substitute in the bindings,
# and then throw them away. (If we didn't throw them away, we
# might think that 2 complete edges are different just because
# they have different bindings, even though all bindings have
# already been applied.)
if dot == len(rhs) and bindings:
lhs = self._bind(lhs, bindings)
rhs = [self._bind(elt, bindings) for elt in rhs]
bindings = {}
# Initialize the edge.
TreeEdge.__init__(self, span, lhs, rhs, dot)
self._bindings = bindings
self._comparison_key = (self._comparison_key, tuple(sorted(bindings.items())))示例2: __init__
# 需要导入模块: from nltk.parse.chart import TreeEdge [as 别名]
# 或者: from nltk.parse.chart.TreeEdge import __init__ [as 别名]
def __init__(self, prob, *args, **kwargs):
TreeEdge.__init__(self, *args, **kwargs)
self._prob = prob
# two edges with different probabilities are not equal.
self._comparison_key = (self._comparison_key, prob)示例3: __init__
# 需要导入模块: from nltk.parse.chart import TreeEdge [as 别名]
# 或者: from nltk.parse.chart.TreeEdge import __init__ [as 别名]
def __init__(self, prob, *args, **kwargs):
self._prob = prob
TreeEdge.__init__(self, *args, **kwargs)