Package nltk :: Package parse :: Module earleychart :: Class FilteredCompleteFundamentalRule

type FilteredCompleteFundamentalRule

             object --+                    
                      |                    
       chart.ChartRuleI --+                
                          |                
    chart.AbstractChartRule --+            
                              |            
          chart.FundamentalRule --+        
                                  |        
    chart.SingleEdgeFundamentalRule --+    
                                      |    
chart.FilteredSingleEdgeFundamentalRule --+
                                          |
                                         FilteredCompleteFundamentalRule

Instance Methods

[hide private]

iter of EdgeI

apply_iter(self, chart, grammar, edge)
Returns: A generator that will add edges licensed by this rule and the given edges to the chart, one at a time.

source code

Inherited from chart.FilteredSingleEdgeFundamentalRule (private): _apply_complete, _apply_incomplete

Inherited from chart.AbstractChartRule: __str__, apply, apply_everywhere, apply_everywhere_iter

Class Variables

[hide private]

Inherited from chart.SingleEdgeFundamentalRule: NUM_EDGES

Method Details

[hide private]

apply_iter(self, chart, grammar, edge)

source code

Parameters:

edges - 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 of EdgeI

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.

Overrides: chart.ChartRuleI.apply_iter

(inherited documentation)