{"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":"/task/text-classification-1/papers/10","list_of":"/task/text-classification-1","task":"text-classification","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":31,"rows_per_page":100,"rows":[901,1000],"of":3054,"counts":{"archive_papers_tagged":3054,"with_a_code_link":1083,"where_syntology_ran_a_sample":204,"not_listed_spam_title":0,"listed":3054,"listed_where_code_ran":204,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":161,"every_run_a_failure_of_syntologys_instrument":43,"listed_with_a_run_with_no_instrument_failure":161,"listed_every_run_a_failure_of_syntologys_instrument":43,"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":"/task/text-classification-1","prev":"/task/text-classification-1/papers/9","next":"/task/text-classification-1/papers/11","papers":[{"url":"/paper/defense-of-word-level-adversarial-attacks-via","slug":"defense-of-word-level-adversarial-attacks-via","title":"Defense of Word-level Adversarial Attacks via Random Substitution Encoding","date":"2020-05-01","arxiv_id":"2005.00446","repositories_listed":1,"syntology":null},{"url":"/paper/mtsi-bert-a-session-aware-knowledge-based","slug":"mtsi-bert-a-session-aware-knowledge-based","title":"MTSI-BERT: A Session-aware Knowledge-based Conversational Agent","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/offensive-language-detection-in-arabic-using","slug":"offensive-language-detection-in-arabic-using","title":"Offensive language detection in Arabic using ULMFiT","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/universal-adversarial-attacks-with-natural","slug":"universal-adversarial-attacks-with-natural","title":"Universal Adversarial Attacks with Natural Triggers for Text Classification","date":"2020-05-01","arxiv_id":"2005.00174","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/universal-adversarial-attacks-with-natural#ran","syntology_url":"https://syntology.ai/paper/2005.00174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00174"}},"official":{"repos":["Hsuan-Tung/universal_attack_natural_trigger"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/why-and-when-should-you-pool-analyzing","slug":"why-and-when-should-you-pool-analyzing","title":"Why and when should you pool? Analyzing Pooling in Recurrent Architectures","date":"2020-05-01","arxiv_id":"2005.00159","repositories_listed":1,"syntology":null},{"url":"/paper/textat-adversarial-training-for-natural","slug":"textat-adversarial-training-for-natural","title":"TAVAT: Token-Aware Virtual Adversarial Training for Language Understanding","date":"2020-04-30","arxiv_id":"2004.14543","repositories_listed":1,"syntology":null},{"url":"/paper/user-guided-aspect-classification-for-domain","slug":"user-guided-aspect-classification-for-domain","title":"User-Guided Aspect Classification for Domain-Specific Texts","date":"2020-04-30","arxiv_id":"2004.14555","repositories_listed":1,"syntology":null},{"url":"/paper/demographics-should-not-be-the-reason-of","slug":"demographics-should-not-be-the-reason-of","title":"Demographics Should Not Be the Reason of Toxicity: Mitigating Discrimination in Text Classifications with Instance Weighting","date":"2020-04-29","arxiv_id":"2004.14088","repositories_listed":1,"syntology":null},{"url":"/paper/scheduled-drophead-a-regularization-method","slug":"scheduled-drophead-a-regularization-method","title":"Scheduled DropHead: A Regularization Method for Transformer Models","date":"2020-04-28","arxiv_id":"2004.13342","repositories_listed":1,"syntology":null},{"url":"/paper/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-batch-normalized-inference-network-keeps","slug":"a-batch-normalized-inference-network-keeps","title":"A Batch Normalized Inference Network Keeps the KL Vanishing Away","date":"2020-04-27","arxiv_id":"2004.12585","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-batch-normalized-inference-network-keeps#ran","syntology_url":"https://syntology.ai/paper/2004.12585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12585"}},"official":{"repos":["valdersoul/bn-vae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/a-gamma-poisson-mixture-topic-model-for-short","slug":"a-gamma-poisson-mixture-topic-model-for-short","title":"A Gamma-Poisson Mixture Topic Model for Short Text","date":"2020-04-23","arxiv_id":"2004.11464","repositories_listed":1,"syntology":null},{"url":"/paper/every-document-owns-its-structure-inductive","slug":"every-document-owns-its-structure-inductive","title":"Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks","date":"2020-04-22","arxiv_id":"2004.13826","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/every-document-owns-its-structure-inductive#ran","syntology_url":"https://syntology.ai/paper/2004.13826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13826"}},"official":null}},{"url":"/paper/light-weighted-cnn-for-text-classification","slug":"light-weighted-cnn-for-text-classification","title":"Light-Weighted CNN for Text Classification","date":"2020-04-16","arxiv_id":"2004.07922","repositories_listed":1,"syntology":null},{"url":"/paper/the-right-tool-for-the-job-matching-model-and","slug":"the-right-tool-for-the-job-matching-model-and","title":"The Right Tool for the Job: Matching Model and Instance Complexities","date":"2020-04-16","arxiv_id":"2004.07453","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-right-tool-for-the-job-matching-model-and#ran","syntology_url":"https://syntology.ai/paper/2004.07453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07453"}},"official":{"repos":["allenai/sledgehammer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/vgcn-bert-augmenting-bert-with-graph","slug":"vgcn-bert-augmenting-bert-with-graph","title":"VGCN-BERT: Augmenting BERT with Graph Embedding for Text Classification","date":"2020-04-12","arxiv_id":"2004.05707","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vgcn-bert-augmenting-bert-with-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05707"}},"official":{"repos":["Louis-udm/VGCN-BERT"],"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"]}}},{"url":"/paper/an-empirical-study-of-invariant-risk","slug":"an-empirical-study-of-invariant-risk","title":"An Empirical Study of Invariant Risk Minimization","date":"2020-04-10","arxiv_id":"2004.05007","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-based-multi-label-text","slug":"deep-learning-based-multi-label-text","title":"Deep Learning Based Multi-Label Text Classification of UNGA Resolutions","date":"2020-04-01","arxiv_id":"2004.03455","repositories_listed":1,"syntology":null},{"url":"/paper/cost-sensitive-bert-for-generalisable-1","slug":"cost-sensitive-bert-for-generalisable-1","title":"Cost-Sensitive BERT for Generalisable Sentence Classification with Imbalanced Data","date":"2020-03-16","arxiv_id":"2003.11563","repositories_listed":1,"syntology":null},{"url":"/paper/text-classification-with-word-embedding","slug":"text-classification-with-word-embedding","title":"Text classification with word embedding regularization and soft similarity measure","date":"2020-03-10","arxiv_id":"2003.05019","repositories_listed":1,"syntology":null},{"url":"/paper/sememnn-a-semantic-matrix-based-memory-neural","slug":"sememnn-a-semantic-matrix-based-memory-neural","title":"SeMemNN: A Semantic Matrix-Based Memory Neural Network for Text Classification","date":"2020-03-04","arxiv_id":"2003.01857","repositories_listed":1,"syntology":null},{"url":"/paper/depth-adaptive-graph-recurrent-network-for","slug":"depth-adaptive-graph-recurrent-network-for","title":"Depth-Adaptive Graph Recurrent Network for Text Classification","date":"2020-02-29","arxiv_id":"2003.00166","repositories_listed":1,"syntology":null},{"url":"/paper/textbrewer-an-open-source-knowledge","slug":"textbrewer-an-open-source-knowledge","title":"TextBrewer: An Open-Source Knowledge Distillation Toolkit for Natural Language Processing","date":"2020-02-28","arxiv_id":"2002.12620","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-based-generalization-for-neural","slug":"diversity-based-generalization-for-neural","title":"Diversity-Based Generalization for Unsupervised Text Classification under Domain Shift","date":"2020-02-25","arxiv_id":"2002.10937","repositories_listed":1,"syntology":null},{"url":"/paper/improving-bert-fine-tuning-via-self-ensemble","slug":"improving-bert-fine-tuning-via-self-ensemble","title":"Improving BERT Fine-Tuning via Self-Ensemble and Self-Distillation","date":"2020-02-24","arxiv_id":"2002.10345","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/improving-bert-fine-tuning-via-self-ensemble#ran","syntology_url":"https://syntology.ai/paper/2002.10345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10345"}},"official":null}},{"url":"/paper/gradient-based-adversarial-training-on","slug":"gradient-based-adversarial-training-on","title":"Gradient-Based Adversarial Training on Transformer Networks for Detecting Check-Worthy Factual Claims","date":"2020-02-18","arxiv_id":"2002.07725","repositories_listed":1,"syntology":null},{"url":"/paper/active-bayesian-assessment-for-black-box","slug":"active-bayesian-assessment-for-black-box","title":"Active Bayesian Assessment for Black-Box Classifiers","date":"2020-02-16","arxiv_id":"2002.06532","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/active-bayesian-assessment-for-black-box#ran","syntology_url":"https://syntology.ai/paper/2002.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06532"}},"official":{"repos":["disiji/bayesian-blackbox"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-exploration-for-optimizing-contextual","slug":"safe-exploration-for-optimizing-contextual","title":"Safe Exploration for Optimizing Contextual Bandits","date":"2020-02-02","arxiv_id":"2002.00467","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-popular-classification-models","slug":"benchmarking-popular-classification-models","title":"Benchmarking Popular Classification Models' Robustness to Random and Targeted Corruptions","date":"2020-01-31","arxiv_id":"2002.00754","repositories_listed":1,"syntology":null},{"url":"/paper/aggregated-learning-a-vector-quantization","slug":"aggregated-learning-a-vector-quantization","title":"Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers","date":"2020-01-12","arxiv_id":"2001.03955","repositories_listed":1,"syntology":null},{"url":"/paper/stacked-debert-all-attention-in-incomplete","slug":"stacked-debert-all-attention-in-incomplete","title":"Stacked DeBERT: All Attention in Incomplete Data for Text Classification","date":"2020-01-01","arxiv_id":"2001.00137","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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","sample_list":"/paper/stacked-debert-all-attention-in-incomplete#ran","syntology_url":"https://syntology.ai/paper/2001.00137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00137"}},"official":{"repos":["gcunhase/StackedDeBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/encoding-word-order-in-complex-embeddings-1","slug":"encoding-word-order-in-complex-embeddings-1","title":"Encoding word order in complex embeddings","date":"2019-12-27","arxiv_id":"1912.12333","repositories_listed":1,"syntology":null},{"url":"/paper/pyss3-a-python-package-implementing-a-novel","slug":"pyss3-a-python-package-implementing-a-novel","title":"PySS3: A Python package implementing a novel text classifier with visualization tools for Explainable AI","date":"2019-12-19","arxiv_id":"1912.09322","repositories_listed":1,"syntology":null},{"url":"/paper/topoact-exploring-the-shape-of-activations-in","slug":"topoact-exploring-the-shape-of-activations-in","title":"TopoAct: Visually Exploring the Shape of Activations in Deep Learning","date":"2019-12-13","arxiv_id":"1912.06332","repositories_listed":1,"syntology":null},{"url":"/paper/less-is-better-unweighted-data-subsampling","slug":"less-is-better-unweighted-data-subsampling","title":"Less Is Better: Unweighted Data Subsampling via Influence Function","date":"2019-12-03","arxiv_id":"1912.01321","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/less-is-better-unweighted-data-subsampling#ran","syntology_url":"https://syntology.ai/paper/1912.01321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01321"}},"official":{"repos":["RyanWangZf/Influence_Subsampling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/not-all-attention-is-needed-gated-attention","slug":"not-all-attention-is-needed-gated-attention","title":"Not All Attention Is Needed: Gated Attention Network for Sequence Data","date":"2019-12-01","arxiv_id":"1912.00349","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-film-capturing-long-range-sequence-1","slug":"temporal-film-capturing-long-range-sequence-1","title":"Temporal FiLM: Capturing Long-Range Sequence Dependencies with Feature-Wise Modulations.","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-cascaded-deep-model-for-bilingual-sms","slug":"a-multi-cascaded-deep-model-for-bilingual-sms","title":"A Multi-cascaded Deep Model for Bilingual SMS Classification","date":"2019-11-29","arxiv_id":"1911.13066","repositories_listed":1,"syntology":null},{"url":"/paper/cawa-an-attention-network-for-credit","slug":"cawa-an-attention-network-for-credit","title":"CAWA: An Attention-Network for Credit Attribution","date":"2019-11-26","arxiv_id":"1911.11358","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-factorization-for-compact-multi-head","slug":"low-rank-factorization-for-compact-multi-head","title":"Low Rank Factorization for Compact Multi-Head Self-Attention","date":"2019-11-26","arxiv_id":"1912.00835","repositories_listed":1,"syntology":null},{"url":"/paper/meta-label-correction-for-learning-with-weak-1","slug":"meta-label-correction-for-learning-with-weak-1","title":"Meta Label Correction for Noisy Label Learning","date":"2019-11-10","arxiv_id":"1911.03809","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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) · 3 unverified","sample_list":"/paper/meta-label-correction-for-learning-with-weak-1#ran","syntology_url":"https://syntology.ai/paper/1911.03809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03809"}},"official":{"repos":["microsoft/mlc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/not-enough-data-deep-learning-to-the-rescue","slug":"not-enough-data-deep-learning-to-the-rescue","title":"Not Enough Data? Deep Learning to the Rescue!","date":"2019-11-08","arxiv_id":"1911.03118","repositories_listed":1,"syntology":null},{"url":"/paper/transformation-of-dense-and-sparse-text","slug":"transformation-of-dense-and-sparse-text","title":"Transformation of Dense and Sparse Text Representations","date":"2019-11-07","arxiv_id":"1911.02914","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-annotate-modularizing-data","slug":"learning-to-annotate-modularizing-data","title":"Learning from Explanations with Neural Execution Tree","date":"2019-11-04","arxiv_id":"1911.01352","repositories_listed":1,"syntology":null},{"url":"/paper/metric-learning-for-dynamic-text-1","slug":"metric-learning-for-dynamic-text-1","title":"Metric Learning for Dynamic Text Classification","date":"2019-11-04","arxiv_id":"1911.01026","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-via-membership-query","slug":"active-learning-via-membership-query","title":"Active Learning via Membership Query Synthesis for Semi-Supervised Sentence Classification","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/label-specific-document-representation-for","slug":"label-specific-document-representation-for","title":"Label-Specific Document Representation for Multi-Label Text Classification","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-ensembling-unsupervised-domain","slug":"adaptive-ensembling-unsupervised-domain","title":"Adaptive Ensembling: Unsupervised Domain Adaptation for Political Document Analysis","date":"2019-10-28","arxiv_id":"1910.12698","repositories_listed":1,"syntology":null},{"url":"/paper/shoestring-graph-based-semi-supervised","slug":"shoestring-graph-based-semi-supervised","title":"Shoestring: Graph-Based Semi-Supervised Learning with Severely Limited Labeled Data","date":"2019-10-28","arxiv_id":"1910.12976","repositories_listed":1,"syntology":null},{"url":"/paper/pt-code-pre-trained-context-dependent-encoder","slug":"pt-code-pre-trained-context-dependent-encoder","title":"PT-CoDE: Pre-trained Context-Dependent Encoder for Utterance-level Emotion Recognition","date":"2019-10-20","arxiv_id":"1910.08916","repositories_listed":1,"syntology":null},{"url":"/paper/many-faces-of-feature-importance-comparing","slug":"many-faces-of-feature-importance-comparing","title":"Many Faces of Feature Importance: Comparing Built-in and Post-hoc Feature Importance in Text Classification","date":"2019-10-18","arxiv_id":"1910.08534","repositories_listed":1,"syntology":null},{"url":"/paper/smokeng-towards-fine-grained-classification","slug":"smokeng-towards-fine-grained-classification","title":"SmokEng: Towards Fine-grained Classification of Tobacco-related Social Media Text","date":"2019-10-12","arxiv_id":"1910.05598","repositories_listed":1,"syntology":null},{"url":"/paper/190910430","slug":"190910430","title":"Does BERT Make Any Sense? Interpretable Word Sense Disambiguation with Contextualized Embeddings","date":"2019-09-23","arxiv_id":"1909.10430","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-film-capturing-long-range-sequence","slug":"temporal-film-capturing-long-range-sequence","title":"Temporal FiLM: Capturing Long-Range Sequence Dependencies with Feature-Wise Modulations","date":"2019-09-14","arxiv_id":"1909.06628","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-shallow-and-deep-learning","slug":"evaluating-shallow-and-deep-learning","title":"Evaluating shallow and deep learning strategies for the 2018 n2c2 shared task on clinical text classification","date":"2019-09-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-robustness-in-multi-class","slug":"transfer-learning-robustness-in-multi-class","title":"Transfer Learning Robustness in Multi-Class Categorization by Fine-Tuning Pre-Trained Contextualized Language Models","date":"2019-09-08","arxiv_id":"1909.03564","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-discriminate-perturbations-for","slug":"learning-to-discriminate-perturbations-for","title":"Learning to Discriminate Perturbations for Blocking Adversarial Attacks in Text Classification","date":"2019-09-06","arxiv_id":"1909.03084","repositories_listed":1,"syntology":null},{"url":"/paper/natural-adversarial-sentence-generation-with","slug":"natural-adversarial-sentence-generation-with","title":"Natural Adversarial Sentence Generation with Gradient-based Perturbation","date":"2019-09-06","arxiv_id":"1909.04495","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-verified-robustness-to-symbol","slug":"achieving-verified-robustness-to-symbol","title":"Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation","date":"2019-09-03","arxiv_id":"1909.01492","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_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) · 0 unverified","sample_list":"/paper/achieving-verified-robustness-to-symbol#ran","syntology_url":"https://syntology.ai/paper/1909.01492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01492"}},"official":{"repos":["deepmind/interval-bound-propagation"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-victory-a-large-scale-systematic","slug":"sparse-victory-a-large-scale-systematic","title":"Sparse Victory -- A Large Scale Systematic Comparison of count-based and prediction-based vectorizers for text classification","date":"2019-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/topics-to-avoid-demoting-latent-confounds-in","slug":"topics-to-avoid-demoting-latent-confounds-in","title":"Topics to Avoid: Demoting Latent Confounds in Text Classification","date":"2019-09-01","arxiv_id":"1909.00453","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-domain-detection-for-low-resource-text","slug":"out-of-domain-detection-for-low-resource-text","title":"Out-of-Domain Detection for Low-Resource Text Classification Tasks","date":"2019-08-31","arxiv_id":"1909.05357","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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","sample_list":"/paper/out-of-domain-detection-for-low-resource-text#ran","syntology_url":"https://syntology.ai/paper/1909.05357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05357"}},"official":{"repos":["SLAD-ml/few-shot-ood"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/human-grounded-evaluations-of-explanation","slug":"human-grounded-evaluations-of-explanation","title":"Human-grounded Evaluations of Explanation Methods for Text Classification","date":"2019-08-29","arxiv_id":"1908.11355","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/human-grounded-evaluations-of-explanation#ran","syntology_url":"https://syntology.ai/paper/1908.11355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11355"}},"official":{"repos":["plkumjorn/CNNAnalysis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-text-classification-with","slug":"hierarchical-text-classification-with","title":"Hierarchical Text Classification with Reinforced Label Assignment","date":"2019-08-27","arxiv_id":"1908.10419","repositories_listed":1,"syntology":null},{"url":"/paper/190807899","slug":"190807899","title":"Evaluating Defensive Distillation For Defending Text Processing Neural Networks Against Adversarial Examples","date":"2019-08-21","arxiv_id":"1908.07899","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-effective-approach-for-fine","slug":"a-simple-and-effective-approach-for-fine","title":"A Simple and Effective Approach for Fine Tuning Pre-trained Word Embeddings for Improved Text Classification","date":"2019-08-07","arxiv_id":"1908.02579","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-biomedical-word-embeddings-by","slug":"enhancing-biomedical-word-embeddings-by","title":"Enhancing biomedical word embeddings by retrofitting to verb clusters","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hulmona-the-universal-language-model-in","slug":"hulmona-the-universal-language-model-in","title":"hULMonA: The Universal Language Model in Arabic","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-figure-captions-and-descriptive","slug":"incorporating-figure-captions-and-descriptive","title":"Incorporating Figure Captions and Descriptive Text in MeSH Term Indexing","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-hate-speech-and-abusive-language","slug":"multi-label-hate-speech-and-abusive-language","title":"Multi-label Hate Speech and Abusive Language Detection in Indonesian Twitter","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/using-functional-schemas-to-understand-social","slug":"using-functional-schemas-to-understand-social","title":"Using Functional Schemas to Understand Social Media Narratives","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-domain-detection","slug":"weakly-supervised-domain-detection","title":"Weakly Supervised Domain Detection","date":"2019-07-26","arxiv_id":"1907.11499","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-uncertainty-in-document-1","slug":"mitigating-uncertainty-in-document-1","title":"Mitigating Uncertainty in Document Classification","date":"2019-07-17","arxiv_id":"1907.07590","repositories_listed":1,"syntology":null},{"url":"/paper/improving-short-text-classification-through","slug":"improving-short-text-classification-through","title":"Improving short text classification through global augmentation methods","date":"2019-07-07","arxiv_id":"1907.03752","repositories_listed":1,"syntology":null},{"url":"/paper/depth-growing-for-neural-machine-translation","slug":"depth-growing-for-neural-machine-translation","title":"Depth Growing for Neural Machine Translation","date":"2019-07-03","arxiv_id":"1907.01968","repositories_listed":1,"syntology":null},{"url":"/paper/effective-adversarial-regularization-for","slug":"effective-adversarial-regularization-for","title":"Effective Adversarial Regularization for Neural Machine Translation","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generating-natural-language-adversarial-2","slug":"generating-natural-language-adversarial-2","title":"Generating Natural Language Adversarial Examples through Probability Weighted Word Saliency","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-multi-label-classification-of","slug":"hierarchical-multi-label-classification-of","title":"Hierarchical Multi-label Classification of Text with Capsule Networks","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-how-to-active-learn-by-dreaming","slug":"learning-how-to-active-learn-by-dreaming","title":"Learning How to Active Learn by Dreaming","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/meta-learning-of-textual-representations","slug":"meta-learning-of-textual-representations","title":"Meta-learning of textual representations","date":"2019-06-21","arxiv_id":"1906.08934","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-taxonomy-aware-and-attentional","slug":"hierarchical-taxonomy-aware-and-attentional","title":"Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification","date":"2019-06-09","arxiv_id":"1906.04898","repositories_listed":1,"syntology":null},{"url":"/paper/is-attention-interpretable","slug":"is-attention-interpretable","title":"Is Attention Interpretable?","date":"2019-06-09","arxiv_id":"1906.03731","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-attention-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03731"}},"official":{"repos":["serrano-s/attn-tests"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simultaneous-classification-and-novelty","slug":"simultaneous-classification-and-novelty","title":"Outlier Exposure with Confidence Control for Out-of-Distribution Detection","date":"2019-06-08","arxiv_id":"1906.03509","repositories_listed":1,"syntology":null},{"url":"/paper/word-embeddings-for-the-armenian-language","slug":"word-embeddings-for-the-armenian-language","title":"Word Embeddings for the Armenian Language: Intrinsic and Extrinsic Evaluation","date":"2019-06-07","arxiv_id":"1906.03134","repositories_listed":1,"syntology":null},{"url":"/paper/evaluation-and-improvement-of-chatbot-text","slug":"evaluation-and-improvement-of-chatbot-text","title":"Evaluation and Improvement of Chatbot Text Classification Data Quality Using Plausible Negative Examples","date":"2019-06-05","arxiv_id":"1906.01910","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-multi-label-text-classification-1","slug":"large-scale-multi-label-text-classification-1","title":"Large-Scale Multi-Label Text Classification on EU Legislation","date":"2019-06-05","arxiv_id":"1906.02192","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-discourse-in-structured-text","slug":"evaluating-discourse-in-structured-text","title":"Evaluating Discourse in Structured Text Representations","date":"2019-06-04","arxiv_id":"1906.01472","repositories_listed":1,"syntology":null},{"url":"/paper/190600642","slug":"190600642","title":"A Variational Approach for Learning from Positive and Unlabeled Data","date":"2019-06-03","arxiv_id":"1906.00642","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/190600642#ran","syntology_url":"https://syntology.ai/paper/1906.00642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00642"}},"official":{"repos":["HC-Feynman/vpu"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/flair-an-easy-to-use-framework-for-state-of","slug":"flair-an-easy-to-use-framework-for-state-of","title":"FLAIR: An Easy-to-Use Framework for State-of-the-Art NLP","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-user-factor-adaptation-for-text","slug":"neural-user-factor-adaptation-for-text","title":"Neural User Factor Adaptation for Text Classification: Learning to Generalize Across Author Demographics","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/swow-8500-word-association-task-for-intrinsic","slug":"swow-8500-word-association-task-for-intrinsic","title":"SWOW-8500: Word Association task for Intrinsic Evaluation of Word Embeddings","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/particle-filter-recurrent-neural-networks","slug":"particle-filter-recurrent-neural-networks","title":"Particle Filter Recurrent Neural Networks","date":"2019-05-30","arxiv_id":"1905.12885","repositories_listed":1,"syntology":null},{"url":"/paper/label-aware-document-representation-via","slug":"label-aware-document-representation-via","title":"Label-aware Document Representation via Hybrid Attention for Extreme Multi-Label Text Classification","date":"2019-05-24","arxiv_id":"1905.10070","repositories_listed":1,"syntology":null},{"url":"/paper/a-text-classification-framework-for-simple","slug":"a-text-classification-framework-for-simple","title":"A Text Classification Framework for Simple and Effective Early Depression Detection Over Social Media Streams","date":"2019-05-18","arxiv_id":"1905.08772","repositories_listed":1,"syntology":null},{"url":"/paper/190602127","slug":"190602127","title":"An Approach for Process Model Extraction By Multi-Grained Text Classification","date":"2019-05-16","arxiv_id":"1906.02127","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-instance-level-annotator","slug":"modelling-instance-level-annotator","title":"Modelling Instance-Level Annotator Reliability for Natural Language Labelling Tasks","date":"2019-05-13","arxiv_id":"1905.04981","repositories_listed":1,"syntology":null},{"url":"/paper/suggestion-mining-from-online-reviews-using","slug":"suggestion-mining-from-online-reviews-using","title":"Suggestion Mining from Online Reviews using ULMFiT","date":"2019-04-19","arxiv_id":"1904.09076","repositories_listed":1,"syntology":null},{"url":"/paper/combining-sentiment-lexica-with-a-multi-view","slug":"combining-sentiment-lexica-with-a-multi-view","title":"Combining Sentiment Lexica with a Multi-View Variational Autoencoder","date":"2019-04-05","arxiv_id":"1904.02839","repositories_listed":1,"syntology":null},{"url":"/paper/ana-at-semeval-2019-task-3-contextual-emotion","slug":"ana-at-semeval-2019-task-3-contextual-emotion","title":"ANA at SemEval-2019 Task 3: Contextual Emotion detection in Conversations through hierarchical LSTMs and BERT","date":"2019-03-30","arxiv_id":"1904.00132","repositories_listed":1,"syntology":null}],"record_sha256":"dedf10a444348917d83ffb5a15ead934089dde6cc93d6357990095bfc8141ed5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}