Jump to content

Talk:CYK algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 89.133.45.42 (talk) at 21:33, 21 June 2007 (Another article on CYK). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

anyone please help is there any proper algorithm to show that how the string is enabled . Example: given a string,the algortithm could give how it comes from the start S, show how many ways it can be ,or even give the shortest way.

It sounds like you're asking about parse trees... the page mentions that the algorithm is easy to modify to find a parse tree (or several). This would show you how to construct the string from the rules. I *think* that with Chomsky normal form, all derivations are the same length, but I'm not really an expert...

This page is great. However - it would incredible with a few examples to lead readers through the process.

Another article on CYK

There is another, almost empty article on the CYK parser: http://en.wikipedia.org/wiki/CYK_%28algorithm%29 The two should be merged (the former should be deleted.)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:CYK_algorithm&oldid=139760881"