Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,263,135 papers from all fields of science
Search
Sign In
Create Free Account
CYK algorithm
Known as:
Cocke-Younger-Kasami
, Cocke-Younger-Kasami algorithm
, Cocke-Kasami-Younger algorithm
Expand
In computer science, the Cocke–Younger–Kasami algorithm (alternatively called CYK, or CKY) is a parsing algorithm for context-free grammars, named…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Ambiguous grammar
Analysis of algorithms
Bottom-up parsing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Title Exploitation of 2 D binary source correlation using turbo block codes with fine-tuning
M. Izhar
,
Mohd Azri
,
N. Fisal
,
Xiaobo Zhou
,
K. Anwar
,
Tadashi Matsumoto
2017
Corpus ID: 13418996
This article proposes a joint source-channel coding technique for two-dimensional (2D) binary Markov sources by using…
Expand
Review
2011
Review
2011
Beam-Width Prediction for Efficient Context-Free Parsing
Nathan Bodenstab
,
Aaron Dunlop
,
Keith B. Hall
,
Brian Roark
Annual Meeting of the Association for…
2011
Corpus ID: 1193152
Efficient decoding for syntactic parsing has become a necessary research area as statistical grammars grow in accuracy and size…
Expand
2010
2010
A late Pleistocene to mid-Holocene stable oxygen isotope record from a Belize stalagmite
MariaLynn Crosby
2010
Corpus ID: 131098400
A ~7,000 year stable isotope record from a Central American stalagmite is presented as a record of rainfall and consequently…
Expand
2008
2008
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
Steffen Mazanek
,
Sonja Schimmler
,
M. Minas
International Conference on Graph Transformation
2008
Corpus ID: 558668
The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been…
Expand
2006
2006
A Comparison of CYK and Earley Parsing Algorithms
Te-chu Li
,
Devi Alagappan
2006
Corpus ID: 13424868
Parsers for programming languages are usually based on context-free grammars. So designing efficient parsing algorithms for…
Expand
2004
2004
Woven convolutional codes. II: decoding aspects
R. Jordan
,
Stefan Höst
,
R. Johannesson
,
M. Bossert
,
V. Zyablov
IEEE Transactions on Information Theory
2004
Corpus ID: 1324117
An iterative decoding scheme for woven convolutional codes is presented. It operates in a window sliding over the received…
Expand
2002
2002
Tessin: Nicodemus Tessin the Younger Royal Architect and Visionary
Mårten Snickare
2002
Corpus ID: 191073173
2000
2000
Uranium Geochemistry in Peraluminous Leucogranites of Wadi El-Shallal Area, Sinai, Egypt
M. Ibrahim
,
A. Hussein
,
A. Osman
,
I. Ibrahim
2000
Corpus ID: 54858808
The two mica granites of El-Shallal area being emplaced into biotite schists, which underwent high temperature low pressure…
Expand
1994
1994
Efficient Disambiguation by means of Stochastic Tree Substitution Grammars
L. Bod
,
S. Krauwer
,
R. Scha
,
K. Sima'an
1994
Corpus ID: 9587615
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many…
Expand
Review
1975
Review
1975
Book Review: Pitt the Younger. by Derek Jarrett
C. Robbins
1975
Corpus ID: 148637381