{"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/fast-and-accurate-entity-recognition-with","title":"Fast and Accurate Entity Recognition with Iterated Dilated Convolutions","arxiv_id":"1702.02098","date":"2017-02-07","proceeding":"EMNLP 2017 9","authors":["Emma Strubell","Patrick Verga","David Belanger","Andrew McCallum"],"abstract":"Today when many practitioners run basic NLP on the entire web and\nlarge-volume traffic, faster methods are paramount to saving time and energy\ncosts. Recent advances in GPU hardware have led to the emergence of\nbi-directional LSTMs as a standard method for obtaining per-token vector\nrepresentations serving as input to labeling tasks such as NER (often followed\nby prediction in a linear-chain CRF). Though expressive and accurate, these\nmodels fail to fully exploit GPU parallelism, limiting their computational\nefficiency. This paper proposes a faster alternative to Bi-LSTMs for NER:\nIterated Dilated Convolutional Neural Networks (ID-CNNs), which have better\ncapacity than traditional CNNs for large context and structured prediction.\nUnlike LSTMs whose sequential processing on sentences of length N requires O(N)\ntime even in the face of parallelism, ID-CNNs permit fixed-depth convolutions\nto run in parallel across entire documents. We describe a distinct combination\nof network structure, parameter sharing and training procedures that enable\ndramatic 14-20x test-time speedups while retaining accuracy comparable to the\nBi-LSTM-CRF. Moreover, ID-CNNs trained to aggregate context from the entire\ndocument are even more accurate while maintaining 8x faster test time speeds.","url_abs":"http://arxiv.org/abs/1702.02098v3","url_pdf":"http://arxiv.org/pdf/1702.02098v3.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":"fast-and-accurate-entity-recognition-with","repo_url":"https://github.com/iesl/dilated-cnn-ner","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"fast-and-accurate-entity-recognition-with","repo_url":"https://github.com/Tuofengalways/ee_Model","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"fast-and-accurate-entity-recognition-with","repo_url":"https://github.com/john-hewitt/conditional-probing","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"fast-and-accurate-entity-recognition-with","repo_url":"https://github.com/zjuym/chinese_cws_ner","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":null,"task_name":"GPU"},{"task_slug":"cg","task_name":"NER"},{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/named-entity-recognition-ner-on-ontonotes-v5","task":"Named Entity Recognition (NER)","dataset":"Ontonotes v5 (English)","model":"BiLSTM-CRF","rank_in_archive_order":25,"of":28,"metrics":{"F1":"86.99"},"uses_additional_data":false},{"leaderboard":"/sota/named-entity-recognition-ner-on-ontonotes-v5","task":"Named Entity Recognition (NER)","dataset":"Ontonotes v5 (English)","model":"Iterated Dilated CNN","rank_in_archive_order":26,"of":28,"metrics":{"F1":"86.84"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.02098","atlas_url":"https://app.syntology.ai/?focus=1702.02098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02098"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.02098"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.02098"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.02098\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1702.02098"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.02098\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.02098"},"call":"get_concepts_for_paper(arxiv_id=\"1702.02098\")"}],"by_repo":[{"repo":"iesl/dilated-cnn-ner","kind":"official","samples":3,"ran":3,"instrument":0,"unverified":0},{"repo":"Tuofengalways/ee_Model","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"john-hewitt/conditional-probing","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.09234"],"harvested_for_calls":[{"arxiv_id":"2109.09234","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.09234"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.09234\")"}]},{"repo":"zjuym/chinese_cws_ner","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1702.02098.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1702.02098.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zjuym/chinese_cws_ner","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/iesl/dilated-cnn-ner","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Tuofengalways/ee_Model","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/john-hewitt/conditional-probing","reach":null}],"summary":{"ran_violates":3},"n_samples":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":3,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"3ef079be3da0b68a","code_sha256_prefix":"3ef079be3da0b68a","entry":"is_background","repo":"iesl/dilated-cnn-ner","repo_kind":"official","path":"src/eval_f1.py","file_url":"https://github.com/iesl/dilated-cnn-ner/blob/HEAD/src/eval_f1.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"curr:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, iesl/dilated-cnn-ner when it was checked","mcp_get_code":{"code_sha256":"3ef079be3da0b68a"}},{"code_sha256":"af722a1af81adfbb","code_sha256_prefix":"af722a1af81adfbb","entry":"is_continue","repo":"iesl/dilated-cnn-ner","repo_kind":"official","path":"src/eval_f1.py","file_url":"https://github.com/iesl/dilated-cnn-ner/blob/HEAD/src/eval_f1.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"curr:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, iesl/dilated-cnn-ner when it was checked","mcp_get_code":{"code_sha256":"af722a1af81adfbb"}},{"code_sha256":"df07c60c27dd08a1","code_sha256_prefix":"df07c60c27dd08a1","entry":"is_start","repo":"iesl/dilated-cnn-ner","repo_kind":"official","path":"src/eval_f1.py","file_url":"https://github.com/iesl/dilated-cnn-ner/blob/HEAD/src/eval_f1.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"curr:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, iesl/dilated-cnn-ner when it was checked","mcp_get_code":{"code_sha256":"df07c60c27dd08a1"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"49705dea0ab586cebdcfe57f4230985c3430a6b92075e092728b852e27ac5de2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}