当前位置: 首页>>代码示例>>Python>>正文


Python chart.TreeEdge类代码示例

本文整理汇总了Python中nltk.parse.chart.TreeEdge的典型用法代码示例。如果您正苦于以下问题:Python TreeEdge类的具体用法?Python TreeEdge怎么用?Python TreeEdge使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


在下文中一共展示了TreeEdge类的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: __init__

    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())))
开发者ID:Weiming-Hu,项目名称:text-based-six-degree,代码行数:25,代码来源:featurechart.py

示例2: __str__

 def __str__(self):
     if self.is_complete():
         return TreeEdge.__unicode__(self)
     else:
         bindings = '{%s}' % ', '.join('%s: %r' % item for item in
                                        sorted(self._bindings.items()))
         return '%s %s' % (TreeEdge.__unicode__(self), bindings)
开发者ID:Weiming-Hu,项目名称:text-based-six-degree,代码行数:7,代码来源:featurechart.py

示例3: __init__

 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)
开发者ID:arizonat,项目名称:nltk,代码行数:5,代码来源:pchart.py

示例4: __cmp__

 def __cmp__(self, other):
     if self._prob != other.prob(): return -1
     return TreeEdge.__cmp__(self, other)
开发者ID:0day1day,项目名称:golismero,代码行数:3,代码来源:pchart.py

示例5: __init__

 def __init__(self, prob, *args, **kwargs):
     self._prob = prob
     TreeEdge.__init__(self, *args, **kwargs)
开发者ID:0day1day,项目名称:golismero,代码行数:3,代码来源:pchart.py

示例6: __str__

 def __str__(self):
     if self.is_complete():
         return TreeEdge.__unicode__(self)
     else:
         bindings = "{%s}" % ", ".join("%s: %r" % item for item in sorted(self._bindings.items()))
         return "%s %s" % (TreeEdge.__unicode__(self), bindings)
开发者ID:pbexe,项目名称:news-graph,代码行数:6,代码来源:featurechart.py


注:本文中的nltk.parse.chart.TreeEdge类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。