The Cocke-Younger-Kasami algorithm (also called as CYK algorithm) is an efficient parsing algorithm for context free grammars in the Chomsky Normal Form (CNF). The algorithm uses dynamic programming to calculate a table of possible states using the characters of the word and the given grammar. It has a worst-case running time of O(n3·|G|) where n is the length of the word and |G| is the size of the given grammar.