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.
We present Graformer, a novel Transformer-based encoder-decoder architecture for graph-to-text generation. With our novel graph self-attention, the encoding of a node relies on all nodes in the input graph - not only direct neighbors - facilitating the detection of global patterns. We represent the relation between two nodes as the length of the shortest path between them. Graformer learns to weight these node-node relations differently for different attention heads, thus virtually learning differently connected views of the input graph. We evaluate Graformer on two popular graph-to-text generation benchmarks, AGENDA and WebNLG, where it achieves strong performance while using many fewer parameters than other approaches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.09242")
get_code_for_paper("2006.09242")
have("2006.09242")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.09242.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.09242)
Connect an agent — have() is free.