nltk.parse.chart.FundamentalRule

class documentation

class FundamentalRule(AbstractChartRule): (source)

Known subclasses: nltk.parse.chart.SingleEdgeFundamentalRule, nltk.parse.featurechart.FeatureFundamentalRule

View In Hierarchy

A rule that joins two adjacent edges to form a single combined edge. In particular, this rule specifies that any pair of edges

  • [A -> alpha \* B beta][i:j]
  • [B -> gamma \*][j:k]

licenses the edge:

  • [A -> alpha B * beta][i:j]
Method apply Return a generator that will add edges licensed by this rule and the given edges to the chart, one at a time. Each time the generator is resumed, it will either add a new edge and yield that edge; or return.
Constant NUM_EDGES Undocumented

Inherited from AbstractChartRule:

Method __str__ Undocumented
Method apply_everywhere Return a generator that will add all edges licensed by this rule, given the edges that are currently in the chart, one at a time. Each time the generator is resumed, it will either add a new edge and yield that edge; or return.
def apply(self, chart, grammar, left_edge, right_edge): (source)
overrides nltk.parse.chart.AbstractChartRule.apply
overridden in nltk.parse.chart.SingleEdgeFundamentalRule, nltk.parse.featurechart.FeatureFundamentalRule

Return a generator that will add edges licensed by this rule and the given edges to the chart, one at a time. Each time the generator is resumed, it will either add a new edge and yield that edge; or return.

Parameters
chartUndocumented
grammarUndocumented
left_edgeUndocumented
right_edgeUndocumented
*edges:list(EdgeI)A set of existing edges. The number of edges that should be passed to apply() is specified by the NUM_EDGES class variable.
Returns
iter(EdgeI)Undocumented
NUM_EDGES: int = (source)
overrides nltk.parse.chart.ChartRuleI.NUM_EDGES
overridden in nltk.parse.chart.SingleEdgeFundamentalRule

Undocumented

Value
2