The model we use is agnostic to any sort of depth: it hypothesizes underspecified tags and allows the matching bracket constraint to select a solution.
we approach the NP Bracketing problem as a tagging and reranking problem.