Talk:CYK algorithm: Difference between revisions

Revision as of 02:37, 18 January 2008

Revision as of 11:56, 23 January 2009

Line 1:

==Explain practical parse tree generation!==

anyone please help

<small>Original threadstarter did not title this thread. Also: linebreaks added to original threadstarter's post. --[[Special:Contributions/131.234.234.12|131.234.234.12]] ([[User talk:131.234.234.12|talk]]) 11:56, 23 January 2009 (UTC)</small><br>

is there any proper algorithm to show that how the string is enabled .

anyone please help<br>

Example:

is there any proper algorithm to show that how the string is enabled .<br>

Example:<br>

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.