Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs

Deep dependency parsing can be cast as the search for maximum acyclic subgraphs in weighted digraphs. Because this search problem is intractable in the general case, we consider its restriction to ...