Trung Bui, Xuanli He, Gholamreza Haffari, Franck Dernoncourt, Zhe Lin, Walter Chang, † Quan, Hung Tran, Nhan Dam
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.
Structured representations like graphs and parse trees play a crucial role in many Natural Language Processing systems. In recent years, the advancements in multi-turn user interfaces necessitate the need for controlling and updating these structured representations given new sources of information. Although there have been many efforts focusing on improving the performance of the parsers that map text to graphs or parse trees, very few have explored the problem of directly manipulating these representations. In this paper, we explore the novel problem of graph modification, where the systems need to learn how to update an existing scene graph given a new user's command. Our novel models based on graph-based sparse transformer and cross attention information fusion outperform previous systems adapted from the machine translation and graph generation literature. We further contribute our large graph modification datasets to the research community to encourage future research for this new problem.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.02591")
get_code_for_paper("2010.02591")
have("2010.02591")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.02591.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.02591)
Connect an agent — have() is free.