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 investigate modeling coreference resolution under a fixed memory constraint by extending an incremental clustering algorithm to utilize contextualized encoders and neural components. Given a new sentence, our end-to-end algorithm proposes and scores each mention span against explicit entity representations created from the earlier document context (if any). These spans are then used to update the entity's representations before being forgotten; we only retain a fixed set of salient entities throughout the document. In this work, we successfully convert a high-performing model (Joshi et al., 2020), asymptotically reducing its memory usage to constant space with only a 0.3% relative loss in F1 on OntoNotes 5.0.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.00128")
get_code_for_paper("2005.00128")
have("2005.00128")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.00128.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.00128)
Connect an agent — have() is free.