In addition to relatively easier portability to other domains and languages the deterministic dependency parsing promises algorithms that are robust and efficient.
an SRL algorithm based on dependency structures is expected to benefit from those properties.