{"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/fastcontext-an-efficient-and-scalable","title":"FastContext: an efficient and scalable implementation of the ConText algorithm","arxiv_id":"1905.00079","date":"2019-04-30","proceeding":null,"authors":["Jianlin Shi","John F. Hurdle"],"abstract":"Objective: To develop and evaluate FastContext, an efficient, scalable\nimplementation of the ConText algorithm suitable for very large-scale clinical\nnatural language processing. Background: The ConText algorithm performs with\nstate-of-art accuracy in detecting the experiencer, negation status, and\ntemporality of concept mentions in clinical narratives. However, the speed\nlimitation of its current implementations hinders its use in big data\nprocessing. Methods: We developed FastContext through hashing the ConText's\nrules, then compared its speed and accuracy with JavaConText and\nGeneralConText, two widely used Java implementations. Results: FastContext ran\ntwo orders of magnitude faster and was less decelerated by rule increase than\nthe other two implementations used in this study for comparison. Additionally,\nFastContext consistently gained accuracy improvement as the rules increased\n(the desired outcome of adding new rules), while the other two implementations\ndid not. Conclusions: FastContext is an efficient, scalable implementation of\nthe popular ConText algorithm, suitable for natural language applications on\nvery large clinical corpora.","url_abs":"http://arxiv.org/abs/1905.00079v1","url_pdf":"http://arxiv.org/pdf/1905.00079v1.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":"fastcontext-an-efficient-and-scalable","repo_url":"https://github.com/jianlins/FastContext","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"negation","task_name":"Negation"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"jianlins/FastContext","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":"42de2daa200e14fc501b149651a4a92dde0917058c653b2d59afd932cee515c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}