The Cocke–Younger–Kasami algorithm (CYK algorithm, also known as CKY algorithm) is a parsing algorithm for context-free grammars. It determines whether a given string can be generated by the grammar (membership problem) and, if so, can be extended to produce a parse tree.
