Revision as of 03:19, 1 September 2006 edit David Chiang (talk \| contribs) 74 edits I don't see what k-best has to do with CKY... ← Previous edit		Revision as of 03:20, 1 September 2006 edit undo David Chiang (talk \| contribs) 74 edits The deleted statement doesn't contribute anything unless elaborated, IMO Next edit →
Line 56: It is also possible to extend the CYK algorithm to parse strings using [[weighted context-free grammar\|weighted]] and [[stochastic context-free grammar]]s. Weights (probabilities) are then stored in the table P instead of booleans, so P[i,j,A] will contain the minimum weight (maximum probability) that the substring from i to j can be derived from A. Further extensions of the algorithm allow all parses of a string to be enumerated from lowest to highest weight (highest to lowest probability). ~~The CKY algorithm can be generalized from [[context-free grammar]] to [[hypergraph]].~~ ==References==

CYK algorithm: Difference between revisions