Revision as of 13:52, 28 May 2002 edit Boleslav Bobcik (talk \| contribs) 171 edits m Initial stub		Revision as of 19:49, 28 May 2002 edit undo AxelBoldt (talk \| contribs) Administrators 44,649 edits No edit summary Next edit →
Line 1: '''Cocke-Younger-Kasami algorithm''' is an example of [[dynamic programming]]. Its purpose is to efficiently parse a string belonging to ~~nondeterministic~~a [[context-free grammar]]. The [[Chomsky Normal Form]] of the grammar is used for this purpose. :''we need the runtime and a description of the algorithm''

CYK algorithm: Difference between revisions