{"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/casict-tibetan-word-segmentation-system-for","title":"CASICT Tibetan Word Segmentation System for MLWS2017","arxiv_id":"1710.06112","date":"2017-10-17","proceeding":null,"authors":["Jiawei Hu","Qun Liu"],"abstract":"We participated in the MLWS 2017 on Tibetan word segmentation task, our\nsystem is trained in a unrestricted way, by introducing a baseline system and\n76w tibetan segmented sentences of ours. In the system character sequence is\nprocessed by the baseline system into word sequence, then a subword unit (BPE\nalgorithm) split rare words into subwords with its corresponding features,\nafter that a neural network classifier is adopted to token each subword into\n\"B,M,E,S\" label, in decoding step a simple rule is used to recover a final word\nsequence. The candidate system for submition is selected by evaluating the\nF-score in dev set pre-extracted from the 76w sentences. Experiment shows that\nthis method can fix segmentation errors of baseline system and result in a\nsignificant performance gain.","url_abs":"http://arxiv.org/abs/1710.06112v1","url_pdf":"http://arxiv.org/pdf/1710.06112v1.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":"casict-tibetan-word-segmentation-system-for","repo_url":"https://github.com/rsennrich/subword-nmt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[],"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":"rsennrich/subword-nmt","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1508.07909","1910.13267"],"harvested_for_calls":[{"arxiv_id":"1508.07909","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1508.07909"},"call":"get_harvested_code_for_paper(arxiv_id=\"1508.07909\")"},{"arxiv_id":"1910.13267","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.13267"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.13267\")"}]}],"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":"8df3ba08dff12c19754970c9f9e79bd1732228e380996273e8830ef279b0865c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}