nltk.LongestChartParser
¶
-
class
nltk.
LongestChartParser
(grammar, beam_size=0, trace=0)[source]¶ A bottom-up parser for
PCFG
grammars that tries longer edges before shorter ones. This sorting order results in a type of best-first search strategy.
Methods¶
__init__ (grammar[, beam_size, trace]) |
Create a new BottomUpProbabilisticChartParser , that uses grammar to parse texts. |
||
grammar () |
|||
parse (tokens) |
|||
parse_all (sent, *args, **kwargs) |
|
||
parse_one (sent, *args, **kwargs) |
|
||
parse_sents (sents, *args, **kwargs) |
Apply self.parse() to each element of sents . |
||
sort_queue (queue, chart) |
|||
trace ([trace]) |
Set the level of tracing output that should be generated when parsing a text. |