In our algorithm, dependency is defined on complicated hidden structures instead of on a graph.
long distance dependency in a graph becomes local in hidden structures, which is desirable from linguistic considerations.