Abstract
We propose a new dependency parsing algorithm, designed to allow for any features while maintaining tractability. The main idea is to start with a baseline parse tree rather than with no tree at all, and to transform that tree into the correct one by repeated application of simple transformation operations.
We focus on inference, discussing anticipated issues and possible remedies. Suggestions towards the training procedure and the feature set are also briefly presented.