{"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/segmental-recurrent-neural-networks","title":"Segmental Recurrent Neural Networks","arxiv_id":"1511.06018","date":"2015-11-18","proceeding":null,"authors":["Lingpeng Kong","Chris Dyer","Noah A. Smith"],"abstract":"We introduce segmental recurrent neural networks (SRNNs) which define, given\nan input sequence, a joint probability distribution over segmentations of the\ninput and labelings of the segments. Representations of the input segments\n(i.e., contiguous subsequences of the input) are computed by encoding their\nconstituent tokens using bidirectional recurrent neural nets, and these\n\"segment embeddings\" are used to define compatibility scores with output\nlabels. These local compatibility scores are integrated using a global\nsemi-Markov conditional random field. Both fully supervised training -- in\nwhich segment boundaries and labels are observed -- as well as partially\nsupervised training -- in which segment boundaries are latent -- are\nstraightforward. Experiments on handwriting recognition and joint Chinese word\nsegmentation/POS tagging show that, compared to models that do not explicitly\nrepresent segments such as BIO tagging schemes and connectionist temporal\nclassification (CTC), SRNNs obtain substantially higher accuracies.","url_abs":"http://arxiv.org/abs/1511.06018v2","url_pdf":"http://arxiv.org/pdf/1511.06018v2.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":"segmental-recurrent-neural-networks","repo_url":"https://github.com/ykrmm/ICLR_2020","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"segmental-recurrent-neural-networks","repo_url":"https://github.com/ykrmm/TREMBA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"chinese-word-segmentation","task_name":"Chinese Word Segmentation"},{"task_slug":"handwriting-recognition","task_name":"Handwriting Recognition"},{"task_slug":"pos","task_name":"POS"},{"task_slug":"pos-tagging","task_name":"POS Tagging"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.06018","atlas_url":"https://app.syntology.ai/?focus=1511.06018","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":"1511.06018"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.06018\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.06018"},"call":"get_concepts_for_paper(arxiv_id=\"1511.06018\")"}],"by_repo":[{"repo":"ykrmm/ICLR_2020","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ykrmm/TREMBA","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":"07ab0d25de7973d217beefa752f59099b1ed9b73c6729cbb8344b80f736e2e0c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}