Skip to search formSkip to main contentSkip to account menu

CYK algorithm

Known as: Cocke-Younger-Kasami, Cocke-Younger-Kasami algorithm, Cocke-Kasami-Younger algorithm 
In computer science, the Cocke–Younger–Kasami algorithm (alternatively called CYK, or CKY) is a parsing algorithm for context-free grammars, named… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper, 2-D normalized min-sum (NMS) algorithm and offset min-sum (OMS) algorithm are proposed for efficient decoding of… 
2011
2011
We present a matrix encoding of context-free grammars, motivated by hardware-level efficiency considerations. We find efficiency… 
2008
2008
We consider the intersymbol interference (ISI) channel detection problem from a combinatorial optimization viewpoint and propose… 
2007
2007
Three cold events (the Younger Dryas, 9.4 ka cal BP, 5.8 ka cal BP) since the 13 ka cal BP in Erhai (EH) Lake catchment, Yunnan… 
2006
2006
An iterative equalization scheme for suppressing intrachannel nonlinearities in high-speed optical transmission systems operating… 
2003
2003
This paper describes recent improvements in Synapse system [5, 6] for inductive inference of context free grammars from sample… 
2002
2002
The classical method for decoding turbo codes is the Bahl-Cocke-Jelinek-Raviv (1974) algorithm which, in the majority of existing… 
1995
1995
Document image decoding (DID) refers to the process of document recognition within a communication theory framework. In this… 
1994
1994
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many… 
1988
1988
The authors describe a syntactive component for large vocabulary speech recognition that incorporates a context-free covering…