They are: Berkeley (Petrov et al., 2006), Bikel (2004), Charniak (2000) and Stanford  chineseFactored, which is also the default used by Stanford dependencies.
our comparison of performance and efficiency across seven popular open source parsers (four constituent and three dependency) shows, by contrast, that recent higher-order graph-based techniques can be more accurate, though somewhat slower, than constituent parsers.