Cyk Algorithm

Cyk Algorithm

Edited by 

List price: US$51.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Cocke-Younger-Kasami algorithm is a parsing algorithm for context-free grammars. It employs bottom-up parsing and dynamic programming. The standard version of CYK operates only on context-free grammars given in Chomsky normal form. However any context-free grammar may be transformed to a CNF grammar expressing the same language. The importance of the CYK algorithm stems from its high efficiency in certain situations. In informal terms, this algorithm considers every possible subsequence of the sequence of words and sets P[i, j, k] to be true if the subsequence of words starting from i of length j can be generated from Rk. Once it has considered subsequences of length 1, it goes on to subsequences of length 2, and so on
show more

Product details

  • Paperback | 100 pages
  • 152 x 229 x 6mm | 159g
  • Claud Press
  • United States
  • English
  • 613659093X
  • 9786136590936