Valiant's algorithm The worst case running time of CYK is , where n is the length of the parsed string and |G| is the size of the CNF grammar G. This makes it one of the most efficient algorithms for recognizing general context-free languages in practice. gave an extension of the CYK algorithm. His algorithm computes the same parsing table as the CYK algorithm; yet he showed that algorithms for efficient multiplication of matrices with 0-1-entries can be utilized for performing this computation.
Valiant's algorithm The worst case running time of CYK is  where n is the length of the parsed string and |G| is the size of the CNF grammar G This makes it one of the most efficient algorithms for recognizing general context-free languages in practice gave an extension of the CYK algorithm His algorithm computes the same parsing table as the CYK algorithm; yet he showed that algorithms for efficient multiplication of matrices with 0-1-entries can be utilized for performing this computation