Jump to content

CYK algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Boleslav Bobcik (talk | contribs) at 13:52, 28 May 2002 (Initial stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Cocke-Younger-Kasami algorithm is an example of dynamic programming. Its purpose is to efficiently parse a string belonging to nondeterministic context-free grammar.

Retrieved from "https://en.wikipedia.org/w/index.php?title=CYK_algorithm&oldid=80802"