Home | Trees | Indices | Help |
|
---|
|
object --+ | api.ParserI --+ | BottomUpChartParser --+ | InsideChartParser
A bottom-up parser for PCFG
s that tries edges in
descending order of the inside probabilities of their trees. The inside
probability of a tree is simply the probability of the entire tree,
ignoring its context. In particular, the inside probability of a tree
generated by production p with children c[1], c[2], ..., c[n] is P(p)*P(c[1])*P(c[2])*...*P(c[n]); and the inside
probability of a token is 1 if it is present in the text, and 0 if it is
absent.
This sorting order results in a type of lowest-cost-first search strategy.
|
|||
None
|
|
||
Inherited from Inherited from Inherited from Inherited from |
|||
Deprecated | |||
---|---|---|---|
Inherited from |
|
|||
Inherited from |
|
|||
Inherited from |
|
Sort the given queue of edges, in descending order of the inside probabilities of the edges' trees.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0beta1 on Wed Aug 27 15:08:56 2008 | http://epydoc.sourceforge.net |