Transition-based parsing algorithms, such as shiftreduce algorithms (Nivre, 2004;Zhang and Clark, 2008), are widely used for dependency analysis because of the efficiency and comparatively good performance.
these parsers have one major problem that they can handle only local information.