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 present a novel graph-based neural network model for relation extraction. Our model treats multiple pairs in a sentence simultaneously and considers interactions among them. All the entities in a sentence are placed as nodes in a fully-connected graph structure. The edges are represented with position-aware contexts around the entity pairs. In order to consider different relation paths between two entities, we construct up to l-length walks between each pair. The resulting walks are merged and iteratively used to update the edge representations into longer walks representations. We show that the model achieves performance comparable to the state-of-the-art systems on the ACE 2005 dataset without using any external tools.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1902.07023")
get_code_for_paper("1902.07023")
have("1902.07023")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1902.07023.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1902.07023)
Connect an agent — have() is free.