{"url":"/sota/sentiment-analysis-on-sst-5-fine-grained","task":{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","note":null},"dataset":{"name":"SST-5 Fine-grained classification","url":"/dataset/sst"},"category":"Computer Vision","categories":["Computer Vision","Natural Language Processing"],"category_note":null,"description":"**Sentiment Analysis** is the task of classifying the polarity of a given text. For instance, a text-based tweet can be categorized into either \"positive\", \"negative\", or \"neutral\". Given the text and accompanying labels, a model can be trained to predict the correct sentiment. \r\n\r\n**Sentiment Analysis** techniques can be categorized into machine learning approaches, lexicon-based approaches, and even hybrid methods. Some subcategories of research in sentiment analysis include: multimodal sentiment analysis, aspect-based sentiment analysis, fine-grained opinion analysis, language specific sentiment analysis.\r\n\r\nMore recently, deep learning techniques, such as RoBERTa and T5, are used to train high-performing sentiment classifiers that are evaluated using metrics like F1, recall, and precision. To evaluate sentiment analysis systems, benchmark datasets like SST, GLUE, and IMDB movie reviews are used.\r\n\r\nFurther readings:\r\n\r\n- [Sentiment Analysis Based on Deep Learning: A Comparative Study](https://paperswithcode.com/paper/sentiment-analysis-based-on-deep-learning-a)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy","Accuracy "],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","Accuracy ":"higher"}},"counts":{"rows":31,"rows_with_code":26,"rows_with_paper_page":31,"rows_dated":31,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Llama-3.3-70B + CAPO","metrics":{"Accuracy":"62.27"},"uses_additional_data":false,"paper_date":"2025-04-22","paper":"/paper/capo-cost-aware-prompt-optimization","paper_url":"https://arxiv.org/abs/2504.16005v3","paper_title":"CAPO: Cost-Aware Prompt Optimization","code":"https://github.com/finitearth/promptolution","n_code_links":2,"syntology":null},{"rank_in_archive_order":2,"model":"Heinsen Routing + RoBERTa Large","metrics":{"Accuracy":"59.8"},"uses_additional_data":false,"paper_date":"2022-11-20","paper":"/paper/an-algorithm-for-routing-vectors-in-sequences","paper_url":"https://arxiv.org/abs/2211.11754v3","paper_title":"An Algorithm for Routing Vectors in Sequences","code":"https://github.com/glassroom/heinsen_routing","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"RoBERTa-large+Self-Explaining","metrics":{"Accuracy":"59.1"},"uses_additional_data":false,"paper_date":"2020-12-03","paper":"/paper/self-explaining-structures-improve-nlp-models","paper_url":"https://arxiv.org/abs/2012.01786v2","paper_title":"Self-Explaining Structures Improve NLP Models","code":"https://github.com/ShannonAI/Self_Explaining_Structures_Improve_NLP_Models","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"Heinsen Routing + GPT-2","metrics":{"Accuracy":"58.5"},"uses_additional_data":false,"paper_date":"2019-11-02","paper":"/paper/an-algorithm-for-routing-capsules-in-all","paper_url":"https://arxiv.org/abs/1911.00792v6","paper_title":"An Algorithm for Routing Capsules in All Domains","code":"https://github.com/glassroom/heinsen_routing","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"BCN+Suffix BiLSTM-Tied+CoVe","metrics":{"Accuracy":"56.2"},"uses_additional_data":false,"paper_date":"2018-05-18","paper":"/paper/improved-sentence-modeling-using-suffix","paper_url":"http://arxiv.org/abs/1805.07340v2","paper_title":"Improved Sentence Modeling using Suffix Bidirectional LSTM","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"BERT Large","metrics":{"Accuracy":"55.5"},"uses_additional_data":false,"paper_date":"2019-10-04","paper":"/paper/fine-grained-sentiment-classification-using","paper_url":"https://arxiv.org/abs/1910.03474v1","paper_title":"Fine-grained Sentiment Classification using BERT","code":"https://github.com/munikarmanish/bert-sentiment","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"LM-CPPF RoBERTa-base","metrics":{"Accuracy":"54.9"},"uses_additional_data":false,"paper_date":"2023-05-29","paper":"/paper/lm-cppf-paraphrasing-guided-data-augmentation","paper_url":"https://arxiv.org/abs/2305.18169v3","paper_title":"LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning","code":"https://github.com/amirabaskohi/lm-cppf","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"BCN+ELMo","metrics":{"Accuracy":"54.7"},"uses_additional_data":false,"paper_date":"2018-02-15","paper":"/paper/deep-contextualized-word-representations","paper_url":"http://arxiv.org/abs/1802.05365v2","paper_title":"Deep contextualized word representations","code":"https://github.com/flairNLP/flair","n_code_links":46,"syntology":{"n_ran":23,"n_unverified":35,"n_samples":58,"n_pointer_only_licence":25}},{"rank_in_archive_order":9,"model":"byte mLSTM7","metrics":{"Accuracy":"54.6"},"uses_additional_data":false,"paper_date":"2018-05-14","paper":"/paper/a-la-carte-embedding-cheap-but-effective","paper_url":"http://arxiv.org/abs/1805.05388v1","paper_title":"A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors","code":"https://github.com/NLPrinceton/ALaCarte","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"BCN+Char+CoVe","metrics":{"Accuracy":"53.7"},"uses_additional_data":false,"paper_date":"2017-08-01","paper":"/paper/learned-in-translation-contextualized-word","paper_url":"http://arxiv.org/abs/1708.00107v2","paper_title":"Learned in Translation: Contextualized Word Vectors","code":"https://github.com/salesforce/cove","n_code_links":5,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":2}},{"rank_in_archive_order":11,"model":"Bi-CAS-LSTM","metrics":{"Accuracy":"53.6"},"uses_additional_data":false,"paper_date":"2018-09-07","paper":"/paper/cell-aware-stacked-lstms-for-modeling","paper_url":"https://arxiv.org/abs/1809.02279v2","paper_title":"Cell-aware Stacked LSTMs for Modeling Sentences","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":12,"model":"CNN-RNF-LSTM","metrics":{"Accuracy":"53.4"},"uses_additional_data":false,"paper_date":"2018-08-28","paper":"/paper/convolutional-neural-networks-with-recurrent","paper_url":"http://arxiv.org/abs/1808.09315v1","paper_title":"Convolutional Neural Networks with Recurrent Neural Filters","code":"https://github.com/bloomberg/cnn-rnf","n_code_links":2,"syntology":null},{"rank_in_archive_order":13,"model":"BERT Base","metrics":{"Accuracy":"53.2"},"uses_additional_data":false,"paper_date":"2019-10-04","paper":"/paper/fine-grained-sentiment-classification-using","paper_url":"https://arxiv.org/abs/1910.03474v1","paper_title":"Fine-grained Sentiment Classification using BERT","code":"https://github.com/munikarmanish/bert-sentiment","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"Star-Transformer","metrics":{"Accuracy":"53.0"},"uses_additional_data":false,"paper_date":"2019-02-25","paper":"/paper/star-transformer","paper_url":"https://arxiv.org/abs/1902.09113v3","paper_title":"Star-Transformer","code":"https://github.com/dmlc/dgl","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"BP-Transformer + GloVe","metrics":{"Accuracy":"52.71"},"uses_additional_data":false,"paper_date":"2019-11-11","paper":"/paper/bp-transformer-modelling-long-range-context","paper_url":"https://arxiv.org/abs/1911.04070v1","paper_title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/transformer","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"MEAN","metrics":{"Accuracy":"51.4"},"uses_additional_data":false,"paper_date":"2018-07-13","paper":"/paper/a-multi-sentiment-resource-enhanced-attention","paper_url":"http://arxiv.org/abs/1807.04990v1","paper_title":"A Multi-sentiment-resource Enhanced Attention Network for Sentiment Classification","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":17,"model":"Constituency Tree-LSTM","metrics":{"Accuracy":"51.0"},"uses_additional_data":false,"paper_date":"2015-02-28","paper":"/paper/improved-semantic-representations-from-tree","paper_url":"http://arxiv.org/abs/1503.00075v3","paper_title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/tree_lstm","n_code_links":16,"syntology":{"n_ran":6,"n_unverified":9,"n_samples":15,"n_pointer_only_licence":6}},{"rank_in_archive_order":18,"model":"Bi-LSTM+2+5","metrics":{"Accuracy":"50.4"},"uses_additional_data":false,"paper_date":"2018-12-04","paper":"/paper/leveraging-multi-grained-sentiment-lexicon","paper_url":"https://arxiv.org/abs/1812.01527v2","paper_title":"Leveraging Multi-grained Sentiment Lexicon Information for Neural Sequence Models","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":19,"model":"MPAD-path","metrics":{"Accuracy":"49.68"},"uses_additional_data":false,"paper_date":"2019-08-17","paper":"/paper/message-passing-attention-networks-for","paper_url":"https://arxiv.org/abs/1908.06267v2","paper_title":"Message Passing Attention Networks for Document Understanding","code":"https://github.com/giannisnik/mpad","n_code_links":2,"syntology":null},{"rank_in_archive_order":20,"model":"Epic","metrics":{"Accuracy":"49.6"},"uses_additional_data":false,"paper_date":"2014-06-01","paper":"/paper/less-grammar-more-features","paper_url":"https://aclanthology.org/P14-1022","paper_title":"Less Grammar, More Features","code":"https://github.com/dlwh/epic","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"RNN-Capsule","metrics":{"Accuracy":"49.3"},"uses_additional_data":false,"paper_date":"2018-02-01","paper":"/paper/sentiment-analysis-by-capsules","paper_url":"https://ntunlpsg.github.io/publication/2018_2_ai/","paper_title":"Sentiment Analysis by Capsules","code":"https://github.com/thuwyq/WWW18-rnn-capsule","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"C-LSTM","metrics":{"Accuracy":"49.2"},"uses_additional_data":false,"paper_date":"2015-11-27","paper":"/paper/a-c-lstm-neural-network-for-text","paper_url":"http://arxiv.org/abs/1511.08630v2","paper_title":"A C-LSTM Neural Network for Text Classification","code":"https://github.com/zackhy/TextClassification","n_code_links":10,"syntology":null},{"rank_in_archive_order":23,"model":"STM+TSED+PT+2L","metrics":{"Accuracy":"49.14"},"uses_additional_data":false,"paper_date":"2019-05-31","paper":"/paper/190600095","paper_url":"https://arxiv.org/abs/1906.00095v1","paper_title":"The Pupil Has Become the Master: Teacher-Student Model-Based Word Embedding Distillation with Ensemble Learning","code":"https://github.com/bgshin/distill_demo","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"SWEM-concat","metrics":{"Accuracy":"46.1"},"uses_additional_data":false,"paper_date":"2018-05-24","paper":"/paper/baseline-needs-more-love-on-simple-word","paper_url":"http://arxiv.org/abs/1805.09843v1","paper_title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","code":"https://github.com/dinghanshen/SWEM","n_code_links":2,"syntology":null},{"rank_in_archive_order":25,"model":"GRU-RNN-WORD2VEC","metrics":{"Accuracy":"45.02"},"uses_additional_data":false,"paper_date":"2017-02-05","paper":"/paper/all-but-the-top-simple-and-effective","paper_url":"http://arxiv.org/abs/1702.01417v2","paper_title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","code":"https://github.com/lgalke/vec4ir","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":24,"n_samples":26,"n_pointer_only_licence":0}},{"rank_in_archive_order":26,"model":"Joined Model Multi-tasking","metrics":{"Accuracy":"44.82"},"uses_additional_data":false,"paper_date":"2017-08-01","paper":"/paper/exploring-joint-neural-model-for-sentence","paper_url":"https://aclanthology.org/W17-5535","paper_title":"Exploring Joint Neural Model for Sentence Level Discourse Parsing and Sentiment Analysis","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":27,"model":"MV-RNN","metrics":{"Accuracy":"44.4"},"uses_additional_data":false,"paper_date":"2013-10-01","paper":"/paper/recursive-deep-models-for-semantic","paper_url":"https://aclanthology.org/D13-1170","paper_title":"Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank","code":"https://github.com/stanfordnlp/CoreNLP","n_code_links":2,"syntology":null},{"rank_in_archive_order":28,"model":"GloVe+Emo2Vec","metrics":{"Accuracy":"43.6"},"uses_additional_data":false,"paper_date":"2018-09-12","paper":"/paper/emo2vec-learning-generalized-emotion","paper_url":"http://arxiv.org/abs/1809.04505v1","paper_title":"Emo2Vec: Learning Generalized Emotion Representation by Multi-task Training","code":"https://github.com/pxuab/emo2vec_wassa_paper","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"Emo2Vec","metrics":{"Accuracy":"41.6"},"uses_additional_data":false,"paper_date":"2018-09-12","paper":"/paper/emo2vec-learning-generalized-emotion","paper_url":"http://arxiv.org/abs/1809.04505v1","paper_title":"Emo2Vec: Learning Generalized Emotion Representation by Multi-task Training","code":"https://github.com/pxuab/emo2vec_wassa_paper","n_code_links":1,"syntology":null},{"rank_in_archive_order":30,"model":"Mistral-Small-24B + CAPO","metrics":{"Accuracy ":"60.2"},"uses_additional_data":false,"paper_date":"2025-04-22","paper":"/paper/capo-cost-aware-prompt-optimization","paper_url":"https://arxiv.org/abs/2504.16005v3","paper_title":"CAPO: Cost-Aware Prompt Optimization","code":"https://github.com/finitearth/promptolution","n_code_links":2,"syntology":null},{"rank_in_archive_order":31,"model":"Qwen2.5-32B + CAPO","metrics":{"Accuracy ":"59.07"},"uses_additional_data":false,"paper_date":"2025-04-22","paper":"/paper/capo-cost-aware-prompt-optimization","paper_url":"https://arxiv.org/abs/2504.16005v3","paper_title":"CAPO: Cost-Aware Prompt Optimization","code":"https://github.com/finitearth/promptolution","n_code_links":2,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":36,"n_unverified":79,"n_samples":115,"n_pointer_only_licence":33,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":36,"n_unverified":81,"n_samples":117,"n_pointer_only_licence":33,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}