English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We generalize Cohen, G\'omez-Rodr\'iguez, and Satta's (2011) parser to afamily of non-projective transition-based dependency parsers allowingpolynomial-time exact inference. This includes novel parsers with bettercoverage than Cohen et al. (2011), and even a variant that reduces timecomplexity to $O(n^6)$, improving over the known bounds in exact inference fornon-projective transition-based parsing. We hope that this piece of theoreticalwork inspires design of novel transition systems with better coverage andbetter run-time guarantees.  Code available at https://github.com/tzshi/nonproj-dp-variants-naacl2018

Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers