| Conclusion | The resulting supervised parser outperforms the Berkeley parser , a state-of-the-art chart parser, in both accuracies and speeds. |
| Experiments | From the results we can see that our extended parser (baseline + padding + supervised features) outperforms the Berkeley parser by 0.3% on English, and is comparable with the Berkeley parser on Chinese (—0.1% less). |
| Experiments | Specifically, the semi-supervised parser is 7 times faster than the Berkeley parser . |
| Introduction | On standard evaluations using both the Penn Treebank and the Penn Chinese Treebank, our parser gave higher accuracies than the Berkeley parser (Petrov and Klein, 2007), a state-of-the-art chart parser. |
| Introduction | In addition, our parser runs with over 89 sentences per second, which is 14 times faster than the Berkeley parser , and is the fastest that we are aware of for phrase-structure parsing. |