The present work is related to that of Hirakawa (2001) who, like us, reduces the problem of dependency parsing to spanning tree search.
his parsing method uses a branch and bound algorithm that is exponential in the worst case, even though it appears to perform reasonably in limited experiments.