CYK algorithm: Difference between revisions

Revision as of 00:25, 2 December 2010

Revision as of 21:42, 20 December 2010

Line 1:

Thethe '''Cocke–Younger–Kasami (CYK) algorithm''' (alternatively called '''CKY''') determines whether a

[[string (computer science)|string]] can be generated by a given [[context-free grammar]] and, if so, how it can be generated. This is known as [[parsing]] the string. The algorithm employs [[bottom-up parsing]] and [[dynamic programming]].