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)

Related topics

Related topics

33 relations
AlgorithmAmbiguous grammarAnalysis of algorithmsBottom-up parsing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Improved Min-Sum Decoding for 2-D Intersymbol Interference Channels
In this paper, 2-D normalized min-sum (NMS) algorithm and offset min-sum (OMS) algorithm are proposed for efficient decoding of… 
2011
2011
Methane and megafauna
To the Editor — The drop in atmospheric methane concentrations at the onset of the Younger Dryas cold event ~12,800 yr ago is… 
2011
2011
Efficient Matrix-Encoded Grammars and Low Latency Parallelization Strategies for CYK
We present a matrix encoding of context-free grammars, motivated by hardware-level efficiency considerations. We find efficiency… 
2008
2008
Reduced-Complexity Turbo Equalization for Coded Intersymbol Interference Channels Based on Local Search Algorithms
We consider the intersymbol interference (ISI) channel detection problem from a combinatorial optimization viewpoint and propose… 
2007
2007
Younger Dryas Event and Cold Events in Early-Mid Holocene: Record from the Sediment of Erhai Lake
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… 
2004
2004
Woven convolutional codes. II: decoding aspects
An iterative decoding scheme for woven convolutional codes is presented. It operates in a window sliding over the received… 
2002
2002
Timing error recovery in turbo-coded systems on AWGN channels
The classical method for decoding turbo codes is the Bahl-Cocke-Jelinek-Raviv (1974) algorithm which, in the majority of existing… 
1995
1995
Stochastic attribute grammar model of document production and its use in document image decoding
Document image decoding (DID) refers to the process of document recognition within a communication theory framework. In this… 
1994
1994
Efficient Disambiguation by means of Stochastic Tree Substitution Grammars
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many… 
1976
1976
On line context free language recognition in less than cubic time(Extended Abstract)
A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)