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

Authors

26

  1. SL
    Susan L. Graham

    University of California, Berkeley, United States

    2 publications · 241 citations

    2

    h-index

  2. WL
    Walter L. Ruzzo

    University of Washington, United States

    2 publications · 241 citations

    2

    h-index

  3. MA
    Michael A. Harrison

    University of California, Berkeley, United States

    2 publications · 241 citations

    2

    h-index

  4. PA
    Philip A. Chou

    Microsoft (United States), United States

    2 publications · 140 citations

    2

    h-index

  5. MA
    Metin Akay

    Rutgers, The State University of New Jersey, United States

    1 publications · 22 citations

    1

    h-index

1–5 of 26

Venues

  1. 2

    h-index

  2. International Journal of Foundations of Computer Science

    IJFCS · 1 publications · 29 citations

    1

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. IEEE Transactions on Computers

    1 publications · 57 citations

    1

    h-index

1–5