(2009) or Huang and Sagae (2010) are accurate and efficient, they can be trained from annotated data without the need for a grammar, and they provide a simple representation of syntax that maps to predicateargument structure in a straightforward way.
transition-based dependency parsers (Nivre, 2008) are a type of dependency parsing algorithms which use a model that scores transitions between parser states.