A popular parsing algorithm is a cubic time chartbased dynamic programming algorithm that uses probabilistic context-free grammars (PCFGs).
experimental results obtained using the Wall Street Journal corpus of the english Penn Treebank achieved a labeled F1 score of 90.68%, and the result for the Penn Chinese Treebank was 84.33%.