{"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/neural-ranking-models-for-temporal-dependency","title":"Neural Ranking Models for Temporal Dependency Structure Parsing","arxiv_id":"1809.00370","date":"2018-09-02","proceeding":"EMNLP 2018 10","authors":["Yuchen Zhang","Nianwen Xue"],"abstract":"We design and build the first neural temporal dependency parser. It utilizes\na neural ranking model with minimal feature engineering, and parses time\nexpressions and events in a text into a temporal dependency tree structure. We\nevaluate our parser on two domains: news reports and narrative stories. In a\nparsing-only evaluation setup where gold time expressions and events are\nprovided, our parser reaches 0.81 and 0.70 f-score on unlabeled and labeled\nparsing respectively, a result that is very competitive against alternative\napproaches. In an end-to-end evaluation setup where time expressions and events\nare automatically recognized, our parser beats two strong baselines on both\ndata domains. Our experimental results and discussions shed light on the nature\nof temporal dependency structures in different domains and provide insights\nthat we believe will be valuable to future research in this area.","url_abs":"http://arxiv.org/abs/1809.00370v1","url_pdf":"http://arxiv.org/pdf/1809.00370v1.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":"neural-ranking-models-for-temporal-dependency","repo_url":"https://github.com/yuchenz/tdp_ranking","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"neural-ranking-models-for-temporal-dependency","repo_url":"https://github.com/bnmin/tdp_ranking","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"feature-engineering","task_name":"Feature Engineering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.00370","atlas_url":"https://app.syntology.ai/?focus=1809.00370","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1809.00370"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.00370\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.00370"},"call":"get_concepts_for_paper(arxiv_id=\"1809.00370\")"}],"by_repo":[{"repo":"yuchenz/tdp_ranking","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bnmin/tdp_ranking","kind":"listed","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":"956ebed4fadb10bcd9b0a3682404195b81e89268bf6a35123452dcb72fdf7d2a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}