We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency information. We first propose a new structure, termed augmented dependency path (ADP), which is composed of the shortest dependency path between two entities and the subtrees attached to the shortest path. To exploit the semantic representation behind the ADP structure, we develop dependency-based neural networks (DepNN): a recursive neural network designed to model the subtrees, and a convolutional neural network to capture the most important features on the shortest path. Experiments on the SemEval-2010 dataset show that our proposed method achieves state-of-art results.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1507.04646")
get_code_for_paper("1507.04646")
have("1507.04646")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1507.04646.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1507.04646)
Connect an agent — have() is free.