Revision as of 20:38, 27 February 2014 edit Teetooan (talk \| contribs) 78 edits m →Generating a parse tree ← Previous edit		Revision as of 20:41, 27 February 2014 edit undo Teetooan (talk \| contribs) 78 edits m →Example Next edit →
Line 75: For readability, the CYK table for ''P'' is represented here as a 2-dimensional matrix ''M'' containing a set of non-terminal symbols, such that R<sub>k</sub> is in ''M[i,j]'' iff ''P[i,j,k]''. In the above example, since ~~the~~a start symbol ''S'' is in ''M[1,7]'', the sentence can be generated by the grammar. ==Extensions==

CYK algorithm: Difference between revisions