An Alternative Formulation of Cocke-Younger-Kasami's Algorithm

Peter R.J. Asveld

    Research output: Contribution to journalArticleAcademicpeer-review

    27 Downloads (Pure)


    We provide a reformulation of Cocke-Younger-Kasami's algorithm for recognizing context-free languages in which there are no references either to indices of table entries or to the length of the input string. Some top-down analogues of this functional approach are discussed as well.
    Original languageEnglish
    Pages (from-to)213-216
    Number of pages4
    JournalBulletin of the European Association for Theoretical Computer Science
    Publication statusPublished - 1994


    • HMI-SLT: Speech and Language Technology
    • Context-free grammar
    • Normal form
    • Recognition
    • Parsing


    Dive into the research topics of 'An Alternative Formulation of Cocke-Younger-Kasami's Algorithm'. Together they form a unique fingerprint.

    Cite this