CYK algorithm: Difference between revisions

Content deleted Content added
Representation is not trivial. Citation needed.
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Citation needed}}
Line 7:
==Standard form==
 
The [[dynamic programming]] algorithm requires the context-free grammar to be rendered into [[Chomsky normal form]] (CNF), because it tests for possibilities to split the current sequence into two smaller sequences. Any context-free grammar that does not generate the empty string can be represented in CNF using only [[Formal grammar#The syntax of grammars|production rules]] of the forms <math>A\rightarrow \alpha</math> and <math>A\rightarrow B C</math>. {{Citation needed|date=September 2021}}
 
==Algorithm==