Caio Corro
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a novel chart-based algorithm for span-based parsing of discontinuous constituency trees of block degree two, including ill-nested structures. In particular, we show that we can build variants of our parser with smaller search spaces and time complexities ranging from O(n 6 ) down to O(n 3 ). The cubic time variant covers 98% of constituents observed in linguistic treebanks while having the same complexity as continuous constituency parsers. We evaluate our approach on German and English treebanks (Negra, Tiger, and DPTB) and report state-of-the-art results in the fully supervised setting. We also experiment with pre-trained word embeddings and Bertbased neural networks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.13785")
get_code_for_paper("2003.13785")
have("2003.13785")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.13785.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.13785)
Connect an agent — have() is free.