CYK algorithm: Difference between revisions

Content deleted Content added
m Parsing non-CNF context-free grammars: symbol n was already in use to denote smth else
Line 68:
===Parsing non-CNF context-free grammars===
 
As pointed out by Lange and Leiß (2009), the drawback of theseall known transformations into Chomsky normal form is that they can lead to an undesirable bloat in grammar size. Using ''g'' to denote the size of the original grammar, the size blow-up in the worst case may range from <math>g^2</math> to <math>2^{2 g}</math>, depending on the used transformation algorithm. For the use in teaching, they propose a slight generalization of the CYK algorithm, "without compromising efficiency of the algorithm, clarity of its presentation, or simplicity of proofs" (Lange and Leiß 2009).
 
===Parsing weighted context-free grammars===