{"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-relation-extraction-via-inner-sentence","title":"Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning","arxiv_id":"1808.06738","date":"2018-08-21","proceeding":"EMNLP 2018 10","authors":["Tianyi Liu","Xinsong Zhang","Wanhao Zhou","Weijia Jia"],"abstract":"Extracting relations is critical for knowledge base completion and\nconstruction in which distant supervised methods are widely used to extract\nrelational facts automatically with the existing knowledge bases. However, the\nautomatically constructed datasets comprise amounts of low-quality sentences\ncontaining noisy words, which is neglected by current distant supervised\nmethods resulting in unacceptable precisions. To mitigate this problem, we\npropose a novel word-level distant supervised approach for relation extraction.\nWe first build Sub-Tree Parse(STP) to remove noisy words that are irrelevant to\nrelations. Then we construct a neural network inputting the sub-tree while\napplying the entity-wise attention to identify the important semantic features\nof relational words in each instance. To make our model more robust against\nnoisy words, we initialize our network with a priori knowledge learned from the\nrelevant task of entity classification by transfer learning. We conduct\nextensive experiments using the corpora of New York Times(NYT) and Freebase.\nExperiments show that our approach is effective and improves the area of\nPrecision/Recall(PR) from 0.35 to 0.39 over the state-of-the-art work.","url_abs":"http://arxiv.org/abs/1808.06738v2","url_pdf":"http://arxiv.org/pdf/1808.06738v2.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":[],"tasks":[{"task_slug":"knowledge-base-completion","task_name":"Knowledge Base Completion"},{"task_slug":null,"task_name":"Relation"},{"task_slug":"relation-extraction","task_name":"Relation Extraction"},{"task_slug":"relationship-extraction-distant-supervised","task_name":"Relationship Extraction (Distant Supervised)"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/relationship-extraction-distant-supervised-on","task":"Relationship Extraction (Distant Supervised)","dataset":"New York Times Corpus","model":"BiGRU+WLA+EWA","rank_in_archive_order":8,"of":9,"metrics":{"AUC":"0.390","Average Precision":"0.390"},"uses_additional_data":false},{"leaderboard":"/sota/relationship-extraction-distant-supervised-on","task":"Relationship Extraction (Distant Supervised)","dataset":"New York Times Corpus","model":"BGRU-SET","rank_in_archive_order":9,"of":9,"metrics":{"AUC":"0.390","Average Precision":"0.390"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.06738","atlas_url":"https://app.syntology.ai/?focus=1808.06738","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":"1808.06738"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.06738\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.06738"},"call":"get_concepts_for_paper(arxiv_id=\"1808.06738\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5a3391c409fc8afe528660e57c3813b8b2e7bc173efc9d713bf7beb60248a836","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}