Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,600,544 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.
2022
2022
LIKE FATHER, LIKE SON?: SELECTED EXAMPLES OF INTERTEXTUALITY IN SENECA THE YOUNGER AND SENECA THE ELDER
C. Trinacty
PHOENIX Workshops
2022
Corpus ID: 163994960
Abstract:In his Epistulae Morales and tragedies, Seneca the Younger is influenced by the rhetorical works of his father. That…
Expand
2014
2014
Improved Min-Sum Decoding for 2-D Intersymbol Interference Channels
L. Kong
,
Yunxiang Jiang
,
G. Han
,
F. Lau
,
Y. Guan
IEEE transactions on magnetics
2014
Corpus ID: 25194991
In this paper, 2-D normalized min-sum (NMS) algorithm and offset min-sum (OMS) algorithm are proposed for efficient decoding of…
Expand
Highly Cited
2012
Highly Cited
2012
Complete suboptimal folding of RNA and the stability of secondary structures , Biopolymers
K. Reinert
2012
Corpus ID: 27815820
2011
2011
Tree Parsing with Synchronous Tree-Adjoining Grammars
Matthias Büchse
,
M. Nederhof
,
H. Vogler
International Workshop/Conference on Parsing…
2011
Corpus ID: 15981961
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in…
Expand
2007
2007
Younger Dryas Event and Cold Events in Early-Mid Holocene: Record from the Sediment of Erhai Lake
Jing Zhou
,
Su-min Wang
,
Guizhi Yang
,
Hai-feng Xiao
2007
Corpus ID: 55381681
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…
Expand
2007
2007
Transforming Projective Bilexical Dependency Grammars into efficiently-parsable CFGs with Unfold-Fold
Mark Johnson
Annual Meeting of the Association for…
2007
Corpus ID: 478500
This paper shows how to use the UnfoldFold transformation to transform Projective Bilexical Dependency Grammars (PBDGs) into…
Expand
2002
2002
Timing error recovery in turbo-coded systems on AWGN channels
B. Mielczarek
,
A. Svensson
IEEE Transactions on Communications
2002
Corpus ID: 10053128
The classical method for decoding turbo codes is the Bahl-Cocke-Jelinek-Raviv (1974) algorithm which, in the majority of existing…
Expand
1995
1995
Stochastic attribute grammar model of document production and its use in document image decoding
P. Chou
,
G. Kopec
Electronic imaging
1995
Corpus ID: 12201404
Document image decoding (DID) refers to the process of document recognition within a communication theory framework. In this…
Expand
1988
1988
Syntactic analysis for large vocabulary speech recognition using a context-free covering grammar
L. G. Miller
,
S. Levinson
ICASSP-88., International Conference on Acoustics…
1988
Corpus ID: 62094912
The authors describe a syntactive component for large vocabulary speech recognition that incorporates a context-free covering…
Expand
1976
1976
On line context free language recognition in less than cubic time(Extended Abstract)
S. Graham
,
M. Harrison
,
W. L. Ruzzo
Symposium on the Theory of Computing
1976
Corpus ID: 18778197
A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several…
Expand
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)
ACCEPT & CONTINUE