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 218.7.20.106 (talk) at 02:32, 21 July 2003 (HELP!!). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.