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.
Recent work has shown that recurrent neural networks (RNNs) can implicitly capture and exploit hierarchical information when trained to solve common natural language processing tasks such as language modeling (Linzen et al., 2016) and neural machine translation (Shi et al., 2016). In contrast, the ability to model structured data with non-recurrent neural networks has received little attention despite their success in many NLP tasks (Gehring et al., 2017; Vaswani et al., 2017). In this work, we compare the two architectures---recurrent versus non-recurrent---with respect to their ability to model hierarchical structure and find that recurrency is indeed important for this purpose.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1803.03585")
get_code_for_paper("1803.03585")
have("1803.03585")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1803.03585.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1803.03585)
Connect an agent — have() is free.