{"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/hierarchically-refined-label-attention","title":"Hierarchically-Refined Label Attention Network for Sequence Labeling","arxiv_id":"1908.08676","date":"2019-08-23","proceeding":"IJCNLP 2019 11","authors":["Leyang Cui","Yue Zhang"],"abstract":"CRF has been used as a powerful model for statistical sequence labeling. For neural sequence labeling, however, BiLSTM-CRF does not always lead to better results compared with BiLSTM-softmax local classification. This can be because the simple Markov label transition model of CRF does not give much information gain over strong neural encoding. For better representing label sequences, we investigate a hierarchically-refined label attention network, which explicitly leverages label embeddings and captures potential long-term label dependency by giving each word incrementally refined label distributions with hierarchical attention. Results on POS tagging, NER and CCG supertagging show that the proposed model not only improves the overall tagging accuracy with similar number of parameters, but also significantly speeds up the training and testing compared to BiLSTM-CRF.","url_abs":"https://arxiv.org/abs/1908.08676v3","url_pdf":"https://arxiv.org/pdf/1908.08676v3.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":"hierarchically-refined-label-attention","repo_url":"https://github.com/Nealcly/LAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hierarchically-refined-label-attention","repo_url":"https://github.com/Nealcly/BiLSTM-LAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"ccg-supertagging","task_name":"CCG Supertagging"},{"task_slug":"cg","task_name":"NER"},{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"pos","task_name":"POS"},{"task_slug":"pos-tagging","task_name":"POS Tagging"},{"task_slug":"part-of-speech-tagging","task_name":"Part-Of-Speech Tagging"}],"methods":[{"method_slug":"crf","method_name":"CRF"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/ccg-supertagging-on-ccgbank","task":"CCG Supertagging","dataset":"CCGbank","model":"BiLSTM-LAN","rank_in_archive_order":5,"of":8,"metrics":{"Accuracy":"94.7"},"uses_additional_data":false},{"leaderboard":"/sota/named-entity-recognition-ner-on-ontonotes-v5","task":"Named Entity Recognition (NER)","dataset":"Ontonotes v5 (English)","model":"BiLSTM-LAN","rank_in_archive_order":21,"of":28,"metrics":{"F1":"88.16"},"uses_additional_data":false},{"leaderboard":"/sota/part-of-speech-tagging-on-penn-treebank","task":"Part-Of-Speech Tagging","dataset":"Penn Treebank","model":"BiLSTM-LAN","rank_in_archive_order":7,"of":20,"metrics":{"Accuracy":"97.65"},"uses_additional_data":false},{"leaderboard":"/sota/part-of-speech-tagging-on-ud","task":"Part-Of-Speech Tagging","dataset":"UD","model":"BiLSTM-LAN","rank_in_archive_order":1,"of":5,"metrics":{"Avg accuracy":"96.88"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1908.08676","atlas_url":"https://app.syntology.ai/?focus=1908.08676","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":"1908.08676"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1908.08676\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1908.08676"},"call":"get_concepts_for_paper(arxiv_id=\"1908.08676\")"}],"by_repo":[{"repo":"Nealcly/LAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Nealcly/BiLSTM-LAN","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":"14566bcb3522fd9c89ad42592c8b7eb11ba0ad55105f54fcec162e749bbb227c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}