Palindrome from topcoder. CYK algorithm. In computer science, the Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) is a parsing algorithm for context-free grammars, its name came from the inventors, John Cocke, Daniel Younger and Tadao Kasami.
It employs bottom-up parsing and dynamic programming. The standard version of CYK operates only on context-free grammars given in Chomsky normal form (CNF). However any context-free grammar may be transformed to a CNF grammar expressing the same language (Sipser 1997). (*Fudge).Problems.