This project implements the Cocke-Kasami-Younger (CKY) algorithm. The CKY algorithm determines whether a given string can be generated by a context-free grammar (CFG) in Chomsky Normal Form (CNF).
Abstract: Low-latency solutions for syntactic parsing are needed if parsing is to become an integral part of user-facing natural language applications. Unfortunately, most state-of-the-art ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results