{"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":"/method/crf/papers/ran/1","list_of":"/method/crf","method":"CRF","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,20],"of":20,"counts":{"archive_papers_tagged":468,"with_a_code_link":159,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":468,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/crf/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/udama-unsupervised-domain-adaptation-through","slug":"udama-unsupervised-domain-adaptation-through","title":"UDAMA: Unsupervised Domain Adaptation through Multi-discriminator Adversarial Training with Noisy Labels Improves Cardio-fitness Prediction","date":"2023-07-31","arxiv_id":"2307.16651","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yvonneywu/udama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/unsupervised-semantic-segmentation-by-2","slug":"unsupervised-semantic-segmentation-by-2","title":"Unsupervised Semantic Segmentation by Distilling Feature Correspondences","date":"2022-03-16","arxiv_id":"2203.08414","n_code_links":3,"syntology":{"ran":11,"of":14,"n_ran_checked":7,"n_instrument":4,"unverified":3,"pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["mhamilton723/STEGO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/regularized-frank-wolfe-for-dense-crfs","slug":"regularized-frank-wolfe-for-dense-crfs","title":"Regularized Frank-Wolfe for Dense CRFs: Generalizing Mean Field and Beyond","date":"2021-10-27","arxiv_id":"2110.14759","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":1,"n_instrument":3,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["netw0rkf10w/crf"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/adversarial-feature-augmentation-and","slug":"adversarial-feature-augmentation-and","title":"Adversarial Feature Augmentation and Normalization for Visual Recognition","date":"2021-03-22","arxiv_id":"2103.12171","n_code_links":1,"syntology":{"ran":5,"of":11,"n_ran_checked":5,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["VITA-Group/CV_A-FAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-semidefinite-programming-based-1","slug":"efficient-semidefinite-programming-based-1","title":"Efficient semidefinite-programming-based inference for binary and multi-class MRFs","date":"2020-12-04","arxiv_id":"2012.02661","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":5,"n_instrument":2,"unverified":2,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["locuslab/sdp_mrf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/fast-and-accurate-sequence-labeling-with","slug":"fast-and-accurate-sequence-labeling-with","title":"AIN: Fast and Accurate Sequence Labeling with Approximate Inference Network","date":"2020-09-17","arxiv_id":"2009.08229","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["Alibaba-NLP/AIN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["found_in_text"]}}},{"paper":"/paper/fast-and-accurate-neural-crf-constituency-1","slug":"fast-and-accurate-neural-crf-constituency-1","title":"Fast and Accurate Neural CRF Constituency Parsing","date":"2020-08-09","arxiv_id":"2008.03736","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/scirex-a-challenge-dataset-for-document-level","slug":"scirex-a-challenge-dataset-for-document-level","title":"SciREX: A Challenge Dataset for Document-Level Information Extraction","date":"2020-05-01","arxiv_id":"2005.00512","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["allenai/SciREX"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/fda-fourier-domain-adaptation-for-semantic","slug":"fda-fourier-domain-adaptation-for-semantic","title":"FDA: Fourier Domain Adaptation for Semantic Segmentation","date":"2020-04-11","arxiv_id":"2004.05498","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["YanchaoYang/FDA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/learning-dynamic-routing-for-semantic","slug":"learning-dynamic-routing-for-semantic","title":"Learning Dynamic Routing for Semantic Segmentation","date":"2020-03-23","arxiv_id":"2003.10401","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/hierarchical-multi-task-natural-language","slug":"hierarchical-multi-task-natural-language","title":"Hierarchical Multi-Task Natural Language Understanding for Cross-domain Conversational AI: HERMIT NLU","date":"2019-10-02","arxiv_id":"1910.00912","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/portuguese-named-entity-recognition-using-1","slug":"portuguese-named-entity-recognition-using-1","title":"Portuguese Named Entity Recognition using BERT-CRF","date":"2019-09-23","arxiv_id":"1909.10649","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["neuralmind-ai/portuguese-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-named-entity-tagger-using-domain","slug":"learning-named-entity-tagger-using-domain","title":"Learning Named Entity Tagger using Domain-Specific Dictionary","date":"2018-09-10","arxiv_id":"1809.03599","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["shangjingbo1226/AutoNER"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/evaluating-the-utility-of-hand-crafted","slug":"evaluating-the-utility-of-hand-crafted","title":"Evaluating the Utility of Hand-crafted Features in Sequence Labelling","date":"2018-08-28","arxiv_id":"1808.09075","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":3,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["minghao-wu/CRF-AE"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/ncrf-an-open-source-neural-sequence-labeling","slug":"ncrf-an-open-source-neural-sequence-labeling","title":"NCRF++: An Open-source Neural Sequence Labeling Toolkit","date":"2018-06-14","arxiv_id":"1806.05626","n_code_links":3,"syntology":{"ran":9,"of":9,"n_ran_checked":8,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jiesutd/NCRFpp"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/adaptive-affinity-fields-for-semantic","slug":"adaptive-affinity-fields-for-semantic","title":"Adaptive Affinity Fields for Semantic Segmentation","date":"2018-03-27","arxiv_id":"1803.10335","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/deeplab-semantic-image-segmentation-with-deep","slug":"deeplab-semantic-image-segmentation-with-deep","title":"DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs","date":"2016-06-02","arxiv_id":"1606.00915","n_code_links":47,"syntology":{"ran":43,"of":63,"n_ran_checked":39,"n_instrument":4,"unverified":20,"pointer_only":18,"phrase":"43 ran (of which 12 constructed an object rather than computing a result; 39 with no instrument failure: 1 honoured, 0 violated, 38 with no contract checked; 4 where Syntology's instrument failed) · 20 unverified","official":null}},{"paper":"/paper/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","n_code_links":25,"syntology":{"ran":24,"of":24,"n_ran_checked":22,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 0 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","n_code_links":25,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/conditional-random-fields-as-recurrent-neural-1","slug":"conditional-random-fields-as-recurrent-neural-1","title":"Conditional Random Fields as Recurrent Neural Networks","date":"2015-02-11","arxiv_id":"1502.03240","n_code_links":6,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["torrvision/crfasrnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}}],"record_sha256":"28df94f65549989882698641bd9d821c9ceae7526f696024e035c585da92c1cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}