Revision as of 06:52, 15 September 2014 edit 111.223.130.195 (talk) Missed two instances of non-\mathit multi-letter identifiers. Did the rest as well for consistency (wondered if it was the cause of a weird inconsistency in left margin, but appears not). ← Previous edit		Revision as of 16:00, 10 October 2014 edit undo Jrgauthier (talk \| contribs) 191 edits m Fluency fix Next edit →
Line 1: In [[computer science]], the '''Cocke–Younger–Kasami algorithm''' (alternatively called '''CYK''', or '''CKY''') is a [[parsing]] [[algorithm]] for [[context-free grammar]]s, ~~its~~named ~~name came from the~~after its 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 {{harv\|Sipser\|1997}}.

CYK algorithm: Difference between revisions