{"url":"/sota/sentiment-analysis-on-mr","task":{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","note":null},"dataset":{"name":"MR","url":"/dataset/mr"},"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","Training Time"],"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","Training Time":"lower"}},"counts":{"rows":19,"rows_with_code":17,"rows_with_paper_page":19,"rows_dated":19,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"VLAWE","metrics":{"Accuracy":"93.3"},"uses_additional_data":false,"paper_date":"2019-02-23","paper":"/paper/vector-of-locally-aggregated-word-embeddings","paper_url":"https://arxiv.org/abs/1902.08850v3","paper_title":"Vector of Locally-Aggregated Word Embeddings (VLAWE): A Novel Document-level Representation","code":"https://github.com/raduionescu/vlawe-boswe","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"RoBERTa-large 355M + Entailment as Few-shot Learner","metrics":{"Accuracy":"92.5"},"uses_additional_data":false,"paper_date":"2021-04-29","paper":"/paper/entailment-as-few-shot-learner","paper_url":"https://arxiv.org/abs/2104.14690v1","paper_title":"Entailment as Few-Shot Learner","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/few_shot/efl","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"AnglE-LLaMA-7B","metrics":{"Accuracy":"91.09"},"uses_additional_data":false,"paper_date":"2023-09-22","paper":"/paper/angle-optimized-text-embeddings","paper_url":"https://arxiv.org/abs/2309.12871v9","paper_title":"AnglE-optimized Text Embeddings","code":"https://github.com/SeanLee97/AnglE","n_code_links":2,"syntology":null},{"rank_in_archive_order":4,"model":"byte mLSTM7","metrics":{"Accuracy":"86.8"},"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":5,"model":"MEAN","metrics":{"Accuracy":"84.5"},"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":6,"model":"RNN-Capsule","metrics":{"Accuracy":"83.8"},"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":7,"model":"Capsule-B","metrics":{"Accuracy":"82.3"},"uses_additional_data":false,"paper_date":"2018-03-29","paper":"/paper/investigating-capsule-networks-with-dynamic","paper_url":"http://arxiv.org/abs/1804.00538v4","paper_title":"Investigating Capsule Networks with Dynamic Routing for Text Classification","code":"https://github.com/andyweizhao/capsule_text_classification","n_code_links":4,"syntology":null},{"rank_in_archive_order":8,"model":"SuBiLSTM-Tied","metrics":{"Accuracy":"81.6"},"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":9,"model":"USE_T+CNN","metrics":{"Accuracy":"81.59"},"uses_additional_data":false,"paper_date":"2018-03-29","paper":"/paper/universal-sentence-encoder","paper_url":"http://arxiv.org/abs/1803.11175v2","paper_title":"Universal Sentence Encoder","code":"https://github.com/facebookresearch/InferSent","n_code_links":24,"syntology":{"n_ran":1,"n_unverified":21,"n_samples":22,"n_pointer_only_licence":1}},{"rank_in_archive_order":10,"model":"STM+TSED+PT+2L","metrics":{"Accuracy":"80.09"},"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":11,"model":"GRU-RNN-WORD2VEC","metrics":{"Accuracy":"78.26"},"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":12,"model":"SWEM-concat","metrics":{"Accuracy":"78.2"},"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":13,"model":"TM-Glove","metrics":{"Accuracy":"77.51"},"uses_additional_data":false,"paper_date":"2021-04-14","paper":"/paper/distributed-word-representation-in-tsetlin","paper_url":"https://arxiv.org/abs/2104.06901v2","paper_title":"Enhancing Interpretable Clauses Semantically using Pretrained Word Representation","code":"https://github.com/cair/TsetlinMachine","n_code_links":6,"syntology":null},{"rank_in_archive_order":14,"model":"Text GCN","metrics":{"Accuracy":"76.74"},"uses_additional_data":false,"paper_date":"2018-09-15","paper":"/paper/graph-convolutional-networks-for-text","paper_url":"http://arxiv.org/abs/1809.05679v3","paper_title":"Graph Convolutional Networks for Text Classification","code":"https://github.com/yao8839836/text_gcn","n_code_links":9,"syntology":{"n_ran":6,"n_unverified":10,"n_samples":16,"n_pointer_only_licence":6}},{"rank_in_archive_order":15,"model":"GraphStar","metrics":{"Accuracy":"76.6"},"uses_additional_data":false,"paper_date":"2019-06-21","paper":"/paper/graph-star-net-for-generalized-multi-task-1","paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","code":"https://github.com/graph-star-team/graph_star","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"S-LSTM","metrics":{"Accuracy":"76.2"},"uses_additional_data":false,"paper_date":"2018-05-07","paper":"/paper/sentence-state-lstm-for-text-representation","paper_url":"http://arxiv.org/abs/1805.02474v1","paper_title":"Sentence-State LSTM for Text Representation","code":"https://github.com/leuchine/S-LSTM","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":17,"model":"SGC","metrics":{"Accuracy":"75.9"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/simplifying-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc","n_code_links":7,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"SGCN","metrics":{"Accuracy":"75.9"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/simplifying-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc","n_code_links":7,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"Millions of Emoji","metrics":{"Training Time":"1500"},"uses_additional_data":false,"paper_date":"2017-08-01","paper":"/paper/using-millions-of-emoji-occurrences-to-learn","paper_url":"http://arxiv.org/abs/1708.00524v2","paper_title":"Using millions of emoji occurrences to learn any-domain representations for detecting sentiment, emotion and sarcasm","code":"https://github.com/bfelbo/deepmoji","n_code_links":7,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}}],"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,795 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":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"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":10,"rows_with_any_sample_ran":10,"distinct_papers_with_graph_line":9,"distinct_papers_with_any_sample_ran":9,"samples_over_distinct_papers":{"n_ran":18,"n_unverified":68,"n_samples":86,"n_pointer_only_licence":8,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":21,"n_unverified":73,"n_samples":94,"n_pointer_only_licence":8,"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"}}}