{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/triad-based-neural-network-for-coreference","title":"Triad-based Neural Network for Coreference Resolution","arxiv_id":"1809.06491","date":"2018-09-18","proceeding":"COLING 2018 8","authors":["Yuanliang Meng","Anna Rumshisky"],"abstract":"We propose a triad-based neural network system that generates affinity scores\nbetween entity mentions for coreference resolution. The system simultaneously\naccepts three mentions as input, taking mutual dependency and logical\nconstraints of all three mentions into account, and thus makes more accurate\npredictions than the traditional pairwise approach. Depending on system\nchoices, the affinity scores can be further used in clustering or mention\nranking. Our experiments show that a standard hierarchical clustering using the\nscores produces state-of-art results with gold mentions on the English portion\nof CoNLL 2012 Shared Task. The model does not rely on many handcrafted features\nand is easy to train and use. The triads can also be easily extended to polyads\nof higher orders. To our knowledge, this is the first neural network system to\nmodel mutual dependency of more than two members at mention level.","url_abs":"http://arxiv.org/abs/1809.06491v1","url_pdf":"http://arxiv.org/pdf/1809.06491v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"triad-based-neural-network-for-coreference","repo_url":"https://github.com/text-machine-lab/entity-coref","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"coreference-resolution","task_name":"Coreference Resolution"},{"task_slug":"coreference-resolution-1","task_name":"coreference-resolution"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"text-machine-lab/entity-coref","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d2b63d6ed405f63f70fe38819aeb0175e49f148353ae83c8698b9f529c45f635","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}