{"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/papers/2","list_of":"/task/text-classification","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":2,"pages_in_order":37,"rows_per_page":100,"rows":[101,200],"of":3635,"counts":{"archive_papers_tagged":3635,"with_a_code_link":1308,"where_syntology_ran_a_sample":272,"not_listed_spam_title":0,"listed":3635,"listed_where_code_ran":272,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":219,"every_run_a_failure_of_syntologys_instrument":53,"listed_with_a_run_with_no_instrument_failure":219,"listed_every_run_a_failure_of_syntologys_instrument":53,"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","prev":"/task/text-classification","next":"/task/text-classification/papers/3","papers":[{"url":"/paper/defending-against-unforeseen-failure-modes","slug":"defending-against-unforeseen-failure-modes","title":"Defending Against Unforeseen Failure Modes with Latent Adversarial Training","date":"2024-03-08","arxiv_id":"2403.05030","repositories_listed":2,"syntology":null},{"url":"/paper/predict-the-next-word-humans-exhibit","slug":"predict-the-next-word-humans-exhibit","title":"Predict the Next Word: Humans exhibit uncertainty in this task and language models _____","date":"2024-02-27","arxiv_id":"2402.17527","repositories_listed":2,"syntology":null},{"url":"/paper/kinit-at-semeval-2024-task-8-fine-tuned-llms","slug":"kinit-at-semeval-2024-task-8-fine-tuned-llms","title":"KInIT at SemEval-2024 Task 8: Fine-tuned LLMs for Multilingual Machine-Generated Text Detection","date":"2024-02-21","arxiv_id":"2402.13671","repositories_listed":2,"syntology":null},{"url":"/paper/accuracy-of-textfooler-black-box-adversarial","slug":"accuracy-of-textfooler-black-box-adversarial","title":"Accuracy of TextFooler black box adversarial attacks on 01 loss sign activation neural network ensemble","date":"2024-02-12","arxiv_id":"2402.07347","repositories_listed":2,"syntology":null},{"url":"/paper/gaussian-adaptive-attention-is-all-you-need","slug":"gaussian-adaptive-attention-is-all-you-need","title":"Density Adaptive Attention is All You Need: Robust Parameter-Efficient Fine-Tuning Across Multiple Modalities","date":"2024-01-20","arxiv_id":"2401.11143","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gaussian-adaptive-attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/2401.11143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11143"}},"official":{"repos":["gioannides/gaussian-adaptive-attention"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/provfl-client-driven-interpretability-of","slug":"provfl-client-driven-interpretability-of","title":"TraceFL: Interpretability-Driven Debugging in Federated Learning via Neuron Provenance","date":"2023-12-21","arxiv_id":"2312.13632","repositories_listed":2,"syntology":null},{"url":"/paper/learn-or-recall-revisiting-incremental","slug":"learn-or-recall-revisiting-incremental","title":"Learn or Recall? Revisiting Incremental Learning with Pre-trained Language Models","date":"2023-12-13","arxiv_id":"2312.07887","repositories_listed":2,"syntology":null},{"url":"/paper/turkishbertweet-fast-and-reliable-large","slug":"turkishbertweet-fast-and-reliable-large","title":"TurkishBERTweet: Fast and Reliable Large Language Model for Social Media Analysis","date":"2023-11-29","arxiv_id":"2311.18063","repositories_listed":2,"syntology":null},{"url":"/paper/dkec-domain-knowledge-enhanced-multi-label","slug":"dkec-domain-knowledge-enhanced-multi-label","title":"DKEC: Domain Knowledge Enhanced Multi-Label Classification for Diagnosis Prediction","date":"2023-10-10","arxiv_id":"2310.07059","repositories_listed":2,"syntology":null},{"url":"/paper/large-scale-korean-text-dataset-for","slug":"large-scale-korean-text-dataset-for","title":"KoMultiText: Large-Scale Korean Text Dataset for Classifying Biased Speech in Real-World Online Services","date":"2023-10-06","arxiv_id":"2310.04313","repositories_listed":2,"syntology":null},{"url":"/paper/label-supervised-llama-finetuning","slug":"label-supervised-llama-finetuning","title":"Label Supervised LLaMA Finetuning","date":"2023-10-02","arxiv_id":"2310.01208","repositories_listed":2,"syntology":null},{"url":"/paper/can-llms-effectively-leverage-structural","slug":"can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","arxiv_id":"2309.16595","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/can-llms-effectively-leverage-structural#ran","syntology_url":"https://syntology.ai/paper/2309.16595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16595"}},"official":{"repos":["trais-lab/llm-structured-data"],"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":["listed","official"]}}},{"url":"/paper/scale-scaling-up-the-complexity-for-advanced","slug":"scale-scaling-up-the-complexity-for-advanced","title":"One Law, Many Languages: Benchmarking Multilingual Legal Reasoning for Judicial Support","date":"2023-06-15","arxiv_id":"2306.09237","repositories_listed":2,"syntology":null},{"url":"/paper/h2ogpt-democratizing-large-language-models","slug":"h2ogpt-democratizing-large-language-models","title":"h2oGPT: Democratizing Large Language Models","date":"2023-06-13","arxiv_id":"2306.08161","repositories_listed":2,"syntology":null},{"url":"/paper/should-we-attend-more-or-less-modulating","slug":"should-we-attend-more-or-less-modulating","title":"Should We Attend More or Less? Modulating Attention for Fairness","date":"2023-05-22","arxiv_id":"2305.13088","repositories_listed":2,"syntology":null},{"url":"/paper/disco-distilled-student-models-co-training","slug":"disco-distilled-student-models-co-training","title":"DisCo: Distilled Student Models Co-training for Semi-supervised Text Mining","date":"2023-05-20","arxiv_id":"2305.12074","repositories_listed":2,"syntology":{"n":17,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":17,"phrase":"5 ran (of which 1 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) · 12 unverified","sample_list":"/paper/disco-distilled-student-models-co-training#ran","syntology_url":"https://syntology.ai/paper/2305.12074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12074"}},"official":{"repos":["litesslhub/disco"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":11,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/gpt-sentinel-distinguishing-human-and-chatgpt","slug":"gpt-sentinel-distinguishing-human-and-chatgpt","title":"GPT-Sentinel: Distinguishing Human and ChatGPT Generated Content","date":"2023-05-13","arxiv_id":"2305.07969","repositories_listed":2,"syntology":null},{"url":"/paper/can-bert-eat-rucola-topological-data-analysis","slug":"can-bert-eat-rucola-topological-data-analysis","title":"Can BERT eat RuCoLA? Topological Data Analysis to Explain","date":"2023-04-04","arxiv_id":"2304.01680","repositories_listed":2,"syntology":null},{"url":"/paper/bolt-an-automated-deep-learning-framework-for","slug":"bolt-an-automated-deep-learning-framework-for","title":"BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardware","date":"2023-03-30","arxiv_id":"2303.17727","repositories_listed":2,"syntology":null},{"url":"/paper/a-multi-grained-self-interpretable-symbolic","slug":"a-multi-grained-self-interpretable-symbolic","title":"A Multi-Grained Self-Interpretable Symbolic-Neural Model For Single/Multi-Labeled Text Classification","date":"2023-03-06","arxiv_id":"2303.02860","repositories_listed":2,"syntology":null},{"url":"/paper/promptboosting-black-box-text-classification","slug":"promptboosting-black-box-text-classification","title":"PromptBoosting: Black-Box Text Classification with Ten Forward Passes","date":"2022-12-19","arxiv_id":"2212.09257","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/promptboosting-black-box-text-classification#ran","syntology_url":"https://syntology.ai/paper/2212.09257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09257"}},"official":{"repos":["ucsb-nlp-chang/promptboosting"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pre-trained-language-models-can-be-fully-zero","slug":"pre-trained-language-models-can-be-fully-zero","title":"Pre-trained Language Models Can be Fully Zero-Shot Learners","date":"2022-12-14","arxiv_id":"2212.06950","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-unsupervised-text-classification","slug":"evaluating-unsupervised-text-classification","title":"Evaluating Unsupervised Text Classification: Zero-shot and Similarity-based Approaches","date":"2022-11-29","arxiv_id":"2211.16285","repositories_listed":2,"syntology":null},{"url":"/paper/genius-sketch-based-language-model-pre","slug":"genius-sketch-based-language-model-pre","title":"GENIUS: Sketch-based Language Model Pre-training via Extreme and Selective Masking for Text Generation and Augmentation","date":"2022-11-18","arxiv_id":"2211.10330","repositories_listed":2,"syntology":null},{"url":"/paper/extending-logic-explained-networks-to-text","slug":"extending-logic-explained-networks-to-text","title":"Extending Logic Explained Networks to Text Classification","date":"2022-11-04","arxiv_id":"2211.09732","repositories_listed":2,"syntology":null},{"url":"/paper/progen-progressive-zero-shot-dataset","slug":"progen-progressive-zero-shot-dataset","title":"ProGen: Progressive Zero-shot Dataset Generation via In-context Feedback","date":"2022-10-22","arxiv_id":"2210.12329","repositories_listed":2,"syntology":null},{"url":"/paper/idna-abf-multi-scale-deep-biological-language","slug":"idna-abf-multi-scale-deep-biological-language","title":"iDNA-ABF: multi-scale deep biological language learning model for the interpretable prediction of DNA methylations","date":"2022-10-17","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/ars2-adaptive-ranking-based-sample-selection","slug":"ars2-adaptive-ranking-based-sample-selection","title":"Adaptive Ranking-based Sample Selection for Weakly Supervised Class-imbalanced Text Classification","date":"2022-10-06","arxiv_id":"2210.03092","repositories_listed":2,"syntology":null},{"url":"/paper/pyabsa-open-framework-for-aspect-based","slug":"pyabsa-open-framework-for-aspect-based","title":"PyABSA: A Modularized Framework for Reproducible Aspect-based Sentiment Analysis","date":"2022-08-02","arxiv_id":"2208.01368","repositories_listed":2,"syntology":null},{"url":"/paper/n-grammer-augmenting-transformers-with-latent-1","slug":"n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","arxiv_id":"2207.06366","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/n-grammer-augmenting-transformers-with-latent-1#ran","syntology_url":"https://syntology.ai/paper/2207.06366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06366"}},"official":{"repos":["tensorflow/lingvo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/two-stage-classifier-for-covid-19","slug":"two-stage-classifier-for-covid-19","title":"Two-Stage Classifier for COVID-19 Misinformation Detection Using BERT: a Study on Indonesian Tweets","date":"2022-06-30","arxiv_id":"2206.15359","repositories_listed":2,"syntology":null},{"url":"/paper/a-quantitative-and-qualitative-analysis-of-1","slug":"a-quantitative-and-qualitative-analysis-of-1","title":"A Quantitative and Qualitative Analysis of Suicide Ideation Detection using Deep Learning","date":"2022-06-17","arxiv_id":"2206.08673","repositories_listed":2,"syntology":null},{"url":"/paper/zerogen-self-guided-high-quality-data","slug":"zerogen-self-guided-high-quality-data","title":"Self-Guided Noise-Free Data Generation for Efficient Zero-Shot Learning","date":"2022-05-25","arxiv_id":"2205.12679","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/zerogen-self-guided-high-quality-data#ran","syntology_url":"https://syntology.ai/paper/2205.12679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12679"}},"official":{"repos":["sumilergao/sungen"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/unifying-language-learning-paradigms","slug":"unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","arxiv_id":"2205.05131","repositories_listed":2,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unifying-language-learning-paradigms#ran","syntology_url":"https://syntology.ai/paper/2205.05131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05131"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/flooding-x-improving-berts-resistance-to","slug":"flooding-x-improving-berts-resistance-to","title":"Flooding-X: Improving BERT’s Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning","date":"2022-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/detecting-text-formality-a-study-of-text","slug":"detecting-text-formality-a-study-of-text","title":"Detecting Text Formality: A Study of Text Classification Approaches","date":"2022-04-19","arxiv_id":"2204.08975","repositories_listed":2,"syntology":null},{"url":"/paper/qdrop-randomly-dropping-quantization-for-1","slug":"qdrop-randomly-dropping-quantization-for-1","title":"QDrop: Randomly Dropping Quantization for Extremely Low-bit Post-Training Quantization","date":"2022-03-11","arxiv_id":"2203.05740","repositories_listed":2,"syntology":{"n":19,"n_ran":14,"n_constructed":5,"n_ran_checked":6,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"14 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qdrop-randomly-dropping-quantization-for-1#ran","syntology_url":"https://syntology.ai/paper/2203.05740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05740"}},"official":{"repos":["modeltc/mqbench","wimh966/QDrop"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-images-label-noise-transition-matrix","slug":"beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","arxiv_id":"2202.01273","repositories_listed":2,"syntology":{"n":25,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/beyond-images-label-noise-transition-matrix#ran","syntology_url":"https://syntology.ai/paper/2202.01273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.01273"}},"official":{"repos":["ucsc-real/beyondimages","ucsc-real/est-t-mi"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-contrastive-learning-text-classification","slug":"dual-contrastive-learning-text-classification","title":"Dual Contrastive Learning: Text Classification via Label-Aware Data Augmentation","date":"2022-01-21","arxiv_id":"2201.08702","repositories_listed":2,"syntology":null},{"url":"/paper/rumedbench-a-russian-medical-language","slug":"rumedbench-a-russian-medical-language","title":"RuMedBench: A Russian Medical Language Understanding Benchmark","date":"2022-01-17","arxiv_id":"2201.06499","repositories_listed":2,"syntology":null},{"url":"/paper/bert-for-sentiment-analysis-pre-trained-and","slug":"bert-for-sentiment-analysis-pre-trained-and","title":"BERT for Sentiment Analysis: Pre-trained and Fine-Tuned Alternatives","date":"2022-01-10","arxiv_id":"2201.03382","repositories_listed":2,"syntology":null},{"url":"/paper/personalized-benchmarking-with-the-ludwig","slug":"personalized-benchmarking-with-the-ludwig","title":"Personalized Benchmarking with the Ludwig Benchmarking Toolkit","date":"2021-11-08","arxiv_id":"2111.04260","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/personalized-benchmarking-with-the-ludwig#ran","syntology_url":"https://syntology.ai/paper/2111.04260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04260"}},"official":{"repos":["ludwig-ai/ludwig"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transprompt-towards-an-automatic-transferable","slug":"transprompt-towards-an-automatic-transferable","title":"TransPrompt: Towards an Automatic Transferable Prompting Framework for Few-shot Text Classification","date":"2021-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tent-text-classification-based-on-encoding","slug":"tent-text-classification-based-on-encoding","title":"Hierarchical information matters: Text classification via tree based graph neural network","date":"2021-10-05","arxiv_id":"2110.02047","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/tent-text-classification-based-on-encoding#ran","syntology_url":"https://syntology.ai/paper/2110.02047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02047"}},"official":{"repos":["daisean/hint","daisean/tent"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/balancing-methods-for-multi-label-text","slug":"balancing-methods-for-multi-label-text","title":"Balancing Methods for Multi-label Text Classification with Long-Tailed Class Distribution","date":"2021-09-10","arxiv_id":"2109.04712","repositories_listed":2,"syntology":null},{"url":"/paper/cartography-active-learning","slug":"cartography-active-learning","title":"Cartography Active Learning","date":"2021-09-09","arxiv_id":"2109.04282","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 0 unverified","sample_list":"/paper/cartography-active-learning#ran","syntology_url":"https://syntology.ai/paper/2109.04282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04282"}},"official":{"repos":["Kaleidophon/deep-significance","jjzha/cal"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/forget-me-not-a-gentle-reminder-to-mind-the","slug":"forget-me-not-a-gentle-reminder-to-mind-the","title":"Bag-of-Words vs. Graph vs. Sequence in Text Classification: Questioning the Necessity of Text-Graphs and the Surprising Strength of a Wide MLP","date":"2021-09-08","arxiv_id":"2109.03777","repositories_listed":2,"syntology":null},{"url":"/paper/aeda-an-easier-data-augmentation-technique","slug":"aeda-an-easier-data-augmentation-technique","title":"AEDA: An Easier Data Augmentation Technique for Text Classification","date":"2021-08-30","arxiv_id":"2108.13230","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/aeda-an-easier-data-augmentation-technique#ran","syntology_url":"https://syntology.ai/paper/2108.13230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13230"}},"official":{"repos":["akkarimi/aeda_nlp"],"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":["listed","official"]}}},{"url":"/paper/semantic-preserving-adversarial-text-attacks","slug":"semantic-preserving-adversarial-text-attacks","title":"Semantic-Preserving Adversarial Text Attacks","date":"2021-08-23","arxiv_id":"2108.10015","repositories_listed":2,"syntology":null},{"url":"/paper/hope-speech-detection-in-under-resourced","slug":"hope-speech-detection-in-under-resourced","title":"Hope Speech detection in under-resourced Kannada language","date":"2021-08-10","arxiv_id":"2108.04616","repositories_listed":2,"syntology":null},{"url":"/paper/knowledgeable-prompt-tuning-incorporating","slug":"knowledgeable-prompt-tuning-incorporating","title":"Knowledgeable Prompt-tuning: Incorporating Knowledge into Prompt Verbalizer for Text Classification","date":"2021-08-04","arxiv_id":"2108.02035","repositories_listed":2,"syntology":null},{"url":"/paper/uncertainty-based-query-strategies-for-active","slug":"uncertainty-based-query-strategies-for-active","title":"Revisiting Uncertainty-based Query Strategies for Active Learning with Transformers","date":"2021-07-12","arxiv_id":"2107.05687","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/uncertainty-based-query-strategies-for-active#ran","syntology_url":"https://syntology.ai/paper/2107.05687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05687"}},"official":{"repos":["webis-de/acl22-revisiting-uncertainty-based-query-strategies-for-active-learning-with-transformers"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/disfl-qa-a-benchmark-dataset-for","slug":"disfl-qa-a-benchmark-dataset-for","title":"Disfl-QA: A Benchmark Dataset for Understanding Disfluencies in Question Answering","date":"2021-06-08","arxiv_id":"2106.04016","repositories_listed":2,"syntology":null},{"url":"/paper/learning-from-multiple-noisy-partial-labelers","slug":"learning-from-multiple-noisy-partial-labelers","title":"Learning from Multiple Noisy Partial Labelers","date":"2021-06-08","arxiv_id":"2106.04530","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-from-multiple-noisy-partial-labelers#ran","syntology_url":"https://syntology.ai/paper/2106.04530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04530"}},"official":{"repos":["batsresearch/nplm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bert-based-sentiment-analysis-a-software","slug":"bert-based-sentiment-analysis-a-software","title":"BERT-Based Sentiment Analysis: A Software Engineering Perspective","date":"2021-06-04","arxiv_id":"2106.02581","repositories_listed":2,"syntology":null},{"url":"/paper/joint-optimization-of-tokenization-and","slug":"joint-optimization-of-tokenization-and","title":"Joint Optimization of Tokenization and Downstream Model","date":"2021-05-26","arxiv_id":"2105.12410","repositories_listed":2,"syntology":null},{"url":"/paper/xeroalign-zero-shot-cross-lingual-transformer","slug":"xeroalign-zero-shot-cross-lingual-transformer","title":"XeroAlign: Zero-Shot Cross-lingual Transformer Alignment","date":"2021-05-06","arxiv_id":"2105.02472","repositories_listed":2,"syntology":null},{"url":"/paper/fantastically-ordered-prompts-and-where-to","slug":"fantastically-ordered-prompts-and-where-to","title":"Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity","date":"2021-04-18","arxiv_id":"2104.08786","repositories_listed":2,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/fantastically-ordered-prompts-and-where-to#ran","syntology_url":"https://syntology.ai/paper/2104.08786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08786"}},"official":null}},{"url":"/paper/when-does-pretraining-help-assessing-self","slug":"when-does-pretraining-help-assessing-self","title":"When Does Pretraining Help? Assessing Self-Supervised Learning for Law and the CaseHOLD Dataset","date":"2021-04-18","arxiv_id":"2104.08671","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/when-does-pretraining-help-assessing-self#ran","syntology_url":"https://syntology.ai/paper/2104.08671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08671"}},"official":{"repos":["reglab/casehold"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/data-distillation-for-text-classification","slug":"data-distillation-for-text-classification","title":"Data Distillation for Text Classification","date":"2021-04-17","arxiv_id":"2104.08448","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-distillation-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/2104.08448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08448"}},"official":{"repos":["liyongqi67/Data-Distillation-for-Text-Classification"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/selfexplain-a-self-explaining-architecture","slug":"selfexplain-a-self-explaining-architecture","title":"SelfExplain: A Self-Explaining Architecture for Neural Text Classifiers","date":"2021-03-23","arxiv_id":"2103.12279","repositories_listed":2,"syntology":null},{"url":"/paper/roberta-wwm-ext-fine-tuning-for-chinese-text","slug":"roberta-wwm-ext-fine-tuning-for-chinese-text","title":"RoBERTa-wwm-ext Fine-Tuning for Chinese Text Classification","date":"2021-02-24","arxiv_id":"2103.00492","repositories_listed":2,"syntology":null},{"url":"/paper/challenges-in-automated-debiasing-for-toxic","slug":"challenges-in-automated-debiasing-for-toxic","title":"Challenges in Automated Debiasing for Toxic Language Detection","date":"2021-01-29","arxiv_id":"2102.00086","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/challenges-in-automated-debiasing-for-toxic#ran","syntology_url":"https://syntology.ai/paper/2102.00086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.00086"}},"official":{"repos":["XuhuiZhou/Toxic_Debias"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/ernie-doc-the-retrospective-long-document","slug":"ernie-doc-the-retrospective-long-document","title":"ERNIE-Doc: A Retrospective Long-Document Modeling Transformer","date":"2020-12-31","arxiv_id":"2012.15688","repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-text-generation-with-pattern","slug":"few-shot-text-generation-with-pattern","title":"Few-Shot Text Generation with Pattern-Exploiting Training","date":"2020-12-22","arxiv_id":"2012.11926","repositories_listed":2,"syntology":null},{"url":"/paper/two-step-classification-using-recasted-data","slug":"two-step-classification-using-recasted-data","title":"Two-Step Classification using Recasted Data for Low Resource Settings","date":"2020-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/automatically-identifying-words-that-can","slug":"automatically-identifying-words-that-can","title":"Automatically Identifying Words That Can Serve as Labels for Few-Shot Text Classification","date":"2020-10-26","arxiv_id":"2010.13641","repositories_listed":2,"syntology":null},{"url":"/paper/text-classification-using-label-names-only-a","slug":"text-classification-using-label-names-only-a","title":"Text Classification Using Label Names Only: A Language Model Self-Training Approach","date":"2020-10-14","arxiv_id":"2010.07245","repositories_listed":2,"syntology":null},{"url":"/paper/converting-the-point-of-view-of-messages","slug":"converting-the-point-of-view-of-messages","title":"Converting the Point of View of Messages Spoken to Virtual Assistants","date":"2020-10-06","arxiv_id":"2010.02600","repositories_listed":2,"syntology":null},{"url":"/paper/poison-attacks-against-text-datasets-with","slug":"poison-attacks-against-text-datasets-with","title":"Poison Attacks against Text Datasets with Conditional Adversarially Regularized Autoencoder","date":"2020-10-06","arxiv_id":"2010.02684","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/poison-attacks-against-text-datasets-with#ran","syntology_url":"https://syntology.ai/paper/2010.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02684"}},"official":{"repos":["alvinchangw/CARA_EMNLP2020"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-adaptation-of-pre-trained-language","slug":"feature-adaptation-of-pre-trained-language","title":"Feature Adaptation of Pre-Trained Language Models across Languages and Domains with Robust Self-Training","date":"2020-09-24","arxiv_id":"2009.11538","repositories_listed":2,"syntology":null},{"url":"/paper/modern-methods-for-text-generation","slug":"modern-methods-for-text-generation","title":"Modern Methods for Text Generation","date":"2020-09-10","arxiv_id":"2009.04968","repositories_listed":2,"syntology":null},{"url":"/paper/a-text-classification-survey-from-shallow-to","slug":"a-text-classification-survey-from-shallow-to","title":"A Survey on Text Classification: From Shallow to Deep Learning","date":"2020-08-02","arxiv_id":"2008.00364","repositories_listed":2,"syntology":null},{"url":"/paper/domain-specific-language-model-pretraining","slug":"domain-specific-language-model-pretraining","title":"Domain-Specific Language Model Pretraining for Biomedical Natural Language Processing","date":"2020-07-31","arxiv_id":"2007.15779","repositories_listed":2,"syntology":null},{"url":"/paper/pretrained-generalized-autoregressive-model","slug":"pretrained-generalized-autoregressive-model","title":"Pretrained Generalized Autoregressive Model with Adaptive Probabilistic Label Clusters for Extreme Multi-label Text Classification","date":"2020-07-05","arxiv_id":"2007.02439","repositories_listed":2,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pretrained-generalized-autoregressive-model#ran","syntology_url":"https://syntology.ai/paper/2007.02439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02439"}},"official":{"repos":["huiyegit/APLC_XLNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/gan-bert-generative-adversarial-learning-for","slug":"gan-bert-generative-adversarial-learning-for","title":"GAN-BERT: Generative Adversarial Learning for Robust Text Classification with a Bunch of Labeled Examples","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/sparse-and-continuous-attention-mechanisms","slug":"sparse-and-continuous-attention-mechanisms","title":"Sparse and Continuous Attention Mechanisms","date":"2020-06-12","arxiv_id":"2006.07214","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":9,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sparse-and-continuous-attention-mechanisms#ran","syntology_url":"https://syntology.ai/paper/2006.07214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07214"}},"official":{"repos":["deep-spin/mcan-vqa-continuous-attention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/massive-choice-ample-tasks-machamp-a-toolkit","slug":"massive-choice-ample-tasks-machamp-a-toolkit","title":"Massive Choice, Ample Tasks (MaChAmp): A Toolkit for Multi-task Learning in NLP","date":"2020-05-29","arxiv_id":"2005.14672","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/massive-choice-ample-tasks-machamp-a-toolkit#ran","syntology_url":"https://syntology.ai/paper/2005.14672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14672"}},"official":{"repos":["machamp-nlp/machamp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-generalization-effects-of-linear","slug":"on-the-generalization-effects-of-linear","title":"On the Generalization Effects of Linear Transformations in Data Augmentation","date":"2020-05-02","arxiv_id":"2005.00695","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":1,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-generalization-effects-of-linear#ran","syntology_url":"https://syntology.ai/paper/2005.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00695"}},"official":{"repos":["SenWu/dauphin"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-faithfully-rationalize-by","slug":"learning-to-faithfully-rationalize-by","title":"Learning to Faithfully Rationalize by Construction","date":"2020-04-30","arxiv_id":"2005.00115","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"12 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-faithfully-rationalize-by#ran","syntology_url":"https://syntology.ai/paper/2005.00115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00115"}},"official":{"repos":["successar/FRESH"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/textattack-a-framework-for-adversarial","slug":"textattack-a-framework-for-adversarial","title":"TextAttack: A Framework for Adversarial Attacks, Data Augmentation, and Adversarial Training in NLP","date":"2020-04-29","arxiv_id":"2005.05909","repositories_listed":2,"syntology":null},{"url":"/paper/mixtext-linguistically-informed-interpolation","slug":"mixtext-linguistically-informed-interpolation","title":"MixText: Linguistically-Informed Interpolation of Hidden Space for Semi-Supervised Text Classification","date":"2020-04-25","arxiv_id":"2004.12239","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-based-text-classification-a","slug":"deep-learning-based-text-classification-a","title":"Deep Learning Based Text Classification: A Comprehensive Review","date":"2020-04-06","arxiv_id":"2004.03705","repositories_listed":2,"syntology":null},{"url":"/paper/bae-bert-based-adversarial-examples-for-text","slug":"bae-bert-based-adversarial-examples-for-text","title":"BAE: BERT-based Adversarial Examples for Text Classification","date":"2020-04-04","arxiv_id":"2004.01970","repositories_listed":2,"syntology":null},{"url":"/paper/generating-hierarchical-explanations-on-text","slug":"generating-hierarchical-explanations-on-text","title":"Generating Hierarchical Explanations on Text Classification via Feature Interaction Detection","date":"2020-04-04","arxiv_id":"2004.02015","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/generating-hierarchical-explanations-on-text#ran","syntology_url":"https://syntology.ai/paper/2004.02015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02015"}},"official":{"repos":["UVa-NLP/HEDGE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/seeing-the-whole-patient-using-multi-label","slug":"seeing-the-whole-patient-using-multi-label","title":"Seeing The Whole Patient: Using Multi-Label Medical Text Classification Techniques to Enhance Predictions of Medical Codes","date":"2020-03-29","arxiv_id":"2004.00430","repositories_listed":2,"syntology":null},{"url":"/paper/multi-label-text-classification-using","slug":"multi-label-text-classification-using","title":"Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-03-22","arxiv_id":"2003.11644","repositories_listed":2,"syntology":null},{"url":"/paper/magnet-multi-label-text-classification-using","slug":"magnet-multi-label-text-classification-using","title":"MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-02-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tensor-graph-convolutional-networks-for-text","slug":"tensor-graph-convolutional-networks-for-text","title":"Tensor Graph Convolutional Networks for Text Classification","date":"2020-01-12","arxiv_id":"2001.05313","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tensor-graph-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/2001.05313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05313"}},"official":{"repos":["xienliu/tensor-gcn-text-classification-tensorflow"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/word-class-embeddings-for-multiclass-text","slug":"word-class-embeddings-for-multiclass-text","title":"Word-Class Embeddings for Multiclass Text Classification","date":"2019-11-26","arxiv_id":"1911.11506","repositories_listed":2,"syntology":null},{"url":"/paper/automatic-text-based-personality-recognition","slug":"automatic-text-based-personality-recognition","title":"Automatic Text-based Personality Recognition on Monologues and Multiparty Dialogues Using Attentive Networks and Contextual Embeddings","date":"2019-11-21","arxiv_id":"1911.09304","repositories_listed":2,"syntology":null},{"url":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}},"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-few-shot-learn-across-diverse","slug":"learning-to-few-shot-learn-across-diverse","title":"Learning to Few-Shot Learn Across Diverse Natural Language Classification Tasks","date":"2019-11-10","arxiv_id":"1911.03863","repositories_listed":2,"syntology":null},{"url":"/paper/learning-data-manipulation-for-augmentation","slug":"learning-data-manipulation-for-augmentation","title":"Learning Data Manipulation for Augmentation and Weighting","date":"2019-10-28","arxiv_id":"1910.12795","repositories_listed":2,"syntology":null},{"url":"/paper/predicting-in-game-actions-from-the-language","slug":"predicting-in-game-actions-from-the-language","title":"Predicting In-game Actions from Interviews of NBA Players","date":"2019-10-24","arxiv_id":"1910.11292","repositories_listed":2,"syntology":null},{"url":"/paper/text-level-graph-neural-network-for-text","slug":"text-level-graph-neural-network-for-text","title":"Text Level Graph Neural Network for Text Classification","date":"2019-10-06","arxiv_id":"1910.02356","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/text-level-graph-neural-network-for-text#ran","syntology_url":"https://syntology.ai/paper/1910.02356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02356"}},"official":{"repos":["mojave-pku/TextLevelGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sampling-bias-in-deep-active-classification","slug":"sampling-bias-in-deep-active-classification","title":"Sampling Bias in Deep Active Classification: An Empirical Study","date":"2019-09-20","arxiv_id":"1909.09389","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sampling-bias-in-deep-active-classification#ran","syntology_url":"https://syntology.ai/paper/1909.09389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09389"}},"official":{"repos":["drimpossible/Sampling-Bias-Active-Learning","Xtra-Computing/thundersvm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/message-passing-attention-networks-for","slug":"message-passing-attention-networks-for","title":"Message Passing Attention Networks for Document Understanding","date":"2019-08-17","arxiv_id":"1908.06267","repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"3e1dc5e95546f5e2b68eec1bb6ba904c2bc480bc96e62cce9ccd25e753a7ceb6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}