nltk.parse.viterbi

module documentation
(source)

Undocumented

Class ViterbiParser A bottom-up PCFG parser that uses dynamic programming to find the single most likely parse for a text. The ViterbiParser parser parses texts by filling in a "most likely constituent table". This table records the most probable tree representation for any given span and node value...
Function demo A demonstration of the probabilistic parsers. The user is prompted to select which demo to run, and how many parses should be found; and then each parser is run on the same demo, and a summary of the results are displayed.
def demo(): (source) ΒΆ

A demonstration of the probabilistic parsers. The user is prompted to select which demo to run, and how many parses should be found; and then each parser is run on the same demo, and a summary of the results are displayed.