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 the class of 1endpoint-crossing (1ec) graphs, which has high coverage on standard data sets. Our main contribution is a characterization of 1ec graphs as a… (More)


9 Figures and Tables

Slides referencing similar topics