Cocke-younger-kasami Algorithm
The Cocke-Younger-Kasami Algorithm is a dynamic programming algorithm for parsing strings in context-free grammars that determines whether a given string can be generated by a grammar in Chomsky Normal Form by systematically constructing all possible parse subtrees in a bottom-up manner.
15
Publications
695
Citations
26
Authors
21
Institutions
Publications per year
2017–2026
0
Parents
15
1–5 of 15
26
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 26
21
University of California, Berkeley
Berkeley, United States
2 h-index
5 publications
506 citations
AT&T (United States)
Bedminster, United States
2 h-index
3 publications
150 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
1 publications
57 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
2 publications
114 citations

Tokyo University of Agriculture and Technology
Tokyo, Japan
1 h-index
2 publications
54 citations

University of Tennessee System
Knoxville, United States
1 h-index
1 publications
57 citations
Japan Advanced Institute of Science and Technology
Nomi Shi, Japan
1 h-index
1 publications
29 citations
University of Sussex
Brighton, United Kingdom
1 h-index
1 publications
92 citations
1–8 of 21
2 publications · 140 citations
2
h-index
IJFCS · 1 publications · 29 citations
1
h-index
1 publications · 217 citations
1
h-index
Repository · 1 publications · 21 citations
1
h-index
1 publications · 57 citations
1
h-index
1–5