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.
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… 
Review
2011
Review
2011
Beam-Width Prediction for Efficient Context-Free Parsing
Efficient decoding for syntactic parsing has become a necessary research area as statistical grammars grow in accuracy and size… 
2008
2008
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been… 
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… 
2000
2000
Uranium Geochemistry in Peraluminous Leucogranites of Wadi El-Shallal Area, Sinai, Egypt
The two mica granites of El-Shallal area being emplaced into biotite schists, which underwent high temperature low pressure… 
1997
1997
A Parallel CKY Parsing Algorithm on Large-Scale Distributed-Memory Parallel Machines
This paper describes an e cient parallel CKY algorithm for CFG. We intend to obtain an e cient HPSG parsing algorithm by using… 
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… 
1990
1990
Late Weichselian and early Holocene vegetation, climate, and floral migration at Utsira, North-Rogaland, southwestern Norway
A Late-glacial/early Holocene pollen diagram from Utsira is interpreted as showing six main climatic periods: (l) The… 
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)