nltk.ProbabilisticProjectiveDependencyParser.train

ProbabilisticProjectiveDependencyParser.train(graphs)[source]

Trains a ProbabilisticDependencyGrammar based on the list of input DependencyGraphs. This model is an implementation of Eisner’s (1996) Model C, which derives its statistics from head-word, head-tag, child-word, and child-tag relationships.

Parameters:graphs – A list of dependency graphs to train from.
Type:list(DependencyGraph)