1. CYK algorithmIn computer science, the Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) 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 (CNF). 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.
Read “CYK algorithm” on English Wikipedia
Read “CYK法” on Japanese Wikipedia
Read “CYK algorithm” on DBpedia
Read “CYK algorithm” on English Wikipedia
Read “CYK法” on Japanese Wikipedia
Read “CYK algorithm” on DBpedia
Discussions
Log in to talk about this word.