{"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/application-of-a-hybrid-bi-lstm-crf-model-to","title":"Application of a Hybrid Bi-LSTM-CRF model to the task of Russian Named Entity Recognition","arxiv_id":"1709.09686","date":"2017-09-27","proceeding":null,"authors":["L. T. Anh","M. Y. Arkhipov","M. S. Burtsev"],"abstract":"Named Entity Recognition (NER) is one of the most common tasks of the natural\nlanguage processing. The purpose of NER is to find and classify tokens in text\ndocuments into predefined categories called tags, such as person names,\nquantity expressions, percentage expressions, names of locations,\norganizations, as well as expression of time, currency and others. Although\nthere is a number of approaches have been proposed for this task in Russian\nlanguage, it still has a substantial potential for the better solutions. In\nthis work, we studied several deep neural network models starting from vanilla\nBi-directional Long Short-Term Memory (Bi-LSTM) then supplementing it with\nConditional Random Fields (CRF) as well as highway networks and finally adding\nexternal word embeddings. All models were evaluated across three datasets:\nGareev's dataset, Person-1000, FactRuEval-2016. We found that extension of\nBi-LSTM model with CRF significantly increased the quality of predictions.\nEncoding input tokens with external word embeddings reduced training time and\nallowed to achieve state of the art for the Russian NER task.","url_abs":"http://arxiv.org/abs/1709.09686v2","url_pdf":"http://arxiv.org/pdf/1709.09686v2.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":"application-of-a-hybrid-bi-lstm-crf-model-to","repo_url":"https://github.com/deepmipt/DeepPavlov","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"application-of-a-hybrid-bi-lstm-crf-model-to","repo_url":"https://github.com/deepmipt/ner","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[{"method_slug":"crf","method_name":"CRF"},{"method_slug":"highway-networks","method_name":"Highway networks"}],"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":"deepmipt/DeepPavlov","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1702.03274"],"harvested_for_calls":[{"arxiv_id":"1702.03274","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.03274"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.03274\")"}]},{"repo":"deepmipt/ner","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.01360"],"harvested_for_calls":[{"arxiv_id":"1603.01360","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.01360"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.01360\")"}]}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fabd29f9f8d5043e082671921b2c1ca0e3273cfc5990cb0cc51a9e8b2ef122a4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}