Therefore, as items for constituency parsers are defined as sets of partial constituency trees, it is tempting to define items for dependency parsers as sets of partial dependency graphs.
predictive grammar-based algorithms such as those of Lombardo and Lesmo (1996) and Kahane et al.