Efficient Third-Order Dependency Parsers


We present algorithms for higher-order dependency parsing that are “third-order” in the sense that they can evaluate substructures containing three dependencies, and “efficient” in the sense that they require only O(n4) time. Importantly, our new parsers can utilize both sibling-style and grandchild-style interactions. We evaluate our parsers on the Penn… (More)



Citations per Year

231 Citations

Semantic Scholar estimates that this publication has 231 citations based on the available data.

See our FAQ for additional information.