{"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/towards-easier-and-faster-sequence-labeling","title":"Towards Easier and Faster Sequence Labeling for Natural Language Processing: A Search-based Probabilistic Online Learning Framework (SAPO)","arxiv_id":"1503.08381","date":"2015-03-29","proceeding":null,"authors":["Xu Sun","Shuming Ma","Yi Zhang","Xuancheng Ren"],"abstract":"There are two major approaches for sequence labeling. One is the\nprobabilistic gradient-based methods such as conditional random fields (CRF)\nand neural networks (e.g., RNN), which have high accuracy but drawbacks: slow\ntraining, and no support of search-based optimization (which is important in\nmany cases). The other is the search-based learning methods such as structured\nperceptron and margin infused relaxed algorithm (MIRA), which have fast\ntraining but also drawbacks: low accuracy, no probabilistic information, and\nnon-convergence in real-world tasks. We propose a novel and \"easy\" solution, a\nsearch-based probabilistic online learning method, to address most of those\nissues. The method is \"easy\", because the optimization algorithm at the\ntraining stage is as simple as the decoding algorithm at the test stage. This\nmethod searches the output candidates, derives probabilities, and conducts\nefficient online learning. We show that this method with fast training and\ntheoretical guarantee of convergence, which is easy to implement, can support\nsearch-based optimization and obtain top accuracy. Experiments on well-known\ntasks show that our method has better accuracy than CRF and BiLSTM\\footnote{The\nSAPO code is released at \\url{https://github.com/lancopku/SAPO}.}.","url_abs":"http://arxiv.org/abs/1503.08381v4","url_pdf":"http://arxiv.org/pdf/1503.08381v4.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":"towards-easier-and-faster-sequence-labeling","repo_url":"https://github.com/lancopku/Decode-CRF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"towards-easier-and-faster-sequence-labeling","repo_url":"https://github.com/lancopku/SAPO","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"towards-easier-and-faster-sequence-labeling","repo_url":"https://github.com/bratao/PySeqLab","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"towards-easier-and-faster-sequence-labeling","repo_url":"https://github.com/uzh-dqbm-cmi/PySeqLab","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"crf","method_name":"CRF"}],"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":"lancopku/Decode-CRF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lancopku/SAPO","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bratao/PySeqLab","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1212.5701"],"harvested_for_calls":[{"arxiv_id":"1212.5701","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1212.5701"},"call":"get_harvested_code_for_paper(arxiv_id=\"1212.5701\")"}]},{"repo":"uzh-dqbm-cmi/PySeqLab","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c658d7783564373d5ad8ba2430b723a99ca78496b30d0f555088c1b7bcaee4c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}