{"url":"/sota/sentiment-analysis-on-yelp-binary","task":{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","note":null},"dataset":{"name":"Yelp Binary classification","url":"/dataset/yelp"},"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":["Error"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Error":"lower"}},"counts":{"rows":20,"rows_with_code":16,"rows_with_paper_page":20,"rows_dated":20,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"XLNet","metrics":{"Error":"1.37"},"uses_additional_data":false,"paper_date":"2019-06-19","paper":"/paper/xlnet-generalized-autoregressive-pretraining","paper_url":"https://arxiv.org/abs/1906.08237v2","paper_title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","code":"https://github.com/huggingface/transformers","n_code_links":27,"syntology":{"n_ran":10,"n_unverified":14,"n_samples":24,"n_pointer_only_licence":3}},{"rank_in_archive_order":2,"model":"BERT_large+ITPT","metrics":{"Error":"1.81"},"uses_additional_data":false,"paper_date":"2019-05-14","paper":"/paper/how-to-fine-tune-bert-for-text-classification","paper_url":"https://arxiv.org/abs/1905.05583v3","paper_title":"How to Fine-Tune BERT for Text Classification?","code":"https://github.com/xuyige/BERT4doc-Classification","n_code_links":15,"syntology":{"n_ran":6,"n_unverified":12,"n_samples":18,"n_pointer_only_licence":5}},{"rank_in_archive_order":3,"model":"LHTR","metrics":{"Error":"1.86"},"uses_additional_data":false,"paper_date":"2020-03-25","paper":"/paper/heavy-tailed-representations-text-polarity","paper_url":"https://arxiv.org/abs/2003.11593v2","paper_title":"Heavy-tailed Representations, Text Polarity Classification & Data Augmentation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":4,"model":"BERT large","metrics":{"Error":"1.89"},"uses_additional_data":false,"paper_date":"2019-04-29","paper":"/paper/unsupervised-data-augmentation-1","paper_url":"https://arxiv.org/abs/1904.12848v6","paper_title":"Unsupervised Data Augmentation for Consistency Training","code":"https://github.com/google-research/uda","n_code_links":20,"syntology":{"n_ran":15,"n_unverified":37,"n_samples":52,"n_pointer_only_licence":9}},{"rank_in_archive_order":5,"model":"BERT_base+ITPT","metrics":{"Error":"1.92"},"uses_additional_data":false,"paper_date":"2019-05-14","paper":"/paper/how-to-fine-tune-bert-for-text-classification","paper_url":"https://arxiv.org/abs/1905.05583v3","paper_title":"How to Fine-Tune BERT for Text Classification?","code":"https://github.com/xuyige/BERT4doc-Classification","n_code_links":15,"syntology":{"n_ran":6,"n_unverified":12,"n_samples":18,"n_pointer_only_licence":5}},{"rank_in_archive_order":6,"model":"BERT large finetune UDA","metrics":{"Error":"2.05"},"uses_additional_data":false,"paper_date":"2019-04-29","paper":"/paper/unsupervised-data-augmentation-1","paper_url":"https://arxiv.org/abs/1904.12848v6","paper_title":"Unsupervised Data Augmentation for Consistency Training","code":"https://github.com/google-research/uda","n_code_links":20,"syntology":{"n_ran":15,"n_unverified":37,"n_samples":52,"n_pointer_only_licence":9}},{"rank_in_archive_order":7,"model":"ULMFiT","metrics":{"Error":"2.16"},"uses_additional_data":false,"paper_date":"2018-01-18","paper":"/paper/universal-language-model-fine-tuning-for-text","paper_url":"http://arxiv.org/abs/1801.06146v5","paper_title":"Universal Language Model Fine-tuning for Text Classification","code":"https://github.com/fastai/fastai","n_code_links":66,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":3}},{"rank_in_archive_order":8,"model":"DPCNN","metrics":{"Error":"2.64"},"uses_additional_data":false,"paper_date":"2017-07-01","paper":"/paper/deep-pyramid-convolutional-neural-networks","paper_url":"https://aclanthology.org/P17-1052","paper_title":"Deep Pyramid Convolutional Neural Networks for Text Categorization","code":"https://github.com/Cheneng/DPCNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"DRNN","metrics":{"Error":"2.73"},"uses_additional_data":false,"paper_date":"2018-07-01","paper":"/paper/disconnected-recurrent-neural-networks-for","paper_url":"https://aclanthology.org/P18-1215","paper_title":"Disconnected Recurrent Neural Networks for Text Categorization","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"CNN","metrics":{"Error":"2.9"},"uses_additional_data":false,"paper_date":"2016-02-07","paper":"/paper/supervised-and-semi-supervised-text","paper_url":"http://arxiv.org/abs/1602.02373v2","paper_title":"Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":11,"model":"Block-sparse LSTM","metrics":{"Error":"3.27"},"uses_additional_data":false,"paper_date":"2017-12-01","paper":"/paper/gpu-kernels-for-block-sparse-weights","paper_url":"https://blog.openai.com/block-sparse-gpu-kernels/","paper_title":"GPU Kernels for Block-Sparse Weights","code":"https://github.com/openai/blocksparse","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"CCCapsNet","metrics":{"Error":"3.52"},"uses_additional_data":false,"paper_date":"2018-10-22","paper":"/paper/compositional-coding-capsule-network-with-k","paper_url":"https://arxiv.org/abs/1810.09177v5","paper_title":"Compositional Coding Capsule Network with K-Means Routing for Text Classification","code":"https://github.com/leftthomas/CCCapsNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"DNC+CUW","metrics":{"Error":"3.60"},"uses_additional_data":false,"paper_date":"2019-01-05","paper":"/paper/learning-to-remember-more-with-less","paper_url":"http://arxiv.org/abs/1901.01347v2","paper_title":"Learning to Remember More with Less Memorization","code":"https://github.com/thaihungle/UW-DNC","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"M-ACNN","metrics":{"Error":"3.89"},"uses_additional_data":false,"paper_date":"2017-09-25","paper":"/paper/learning-context-sensitive-convolutional","paper_url":"http://arxiv.org/abs/1709.08294v3","paper_title":"Learning Context-Sensitive Convolutional Filters for Text Processing","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"SRNN","metrics":{"Error":"3.96"},"uses_additional_data":false,"paper_date":"2018-07-06","paper":"/paper/sliced-recurrent-neural-networks","paper_url":"http://arxiv.org/abs/1807.02291v1","paper_title":"Sliced Recurrent Neural Networks","code":"https://github.com/zepingyu0512/srnn","n_code_links":3,"syntology":null},{"rank_in_archive_order":16,"model":"SWEM-hier","metrics":{"Error":"4.19"},"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":17,"model":"fastText, h=10, bigram","metrics":{"Error":"4.3"},"uses_additional_data":false,"paper_date":"2016-07-06","paper":"/paper/bag-of-tricks-for-efficient-text","paper_url":"http://arxiv.org/abs/1607.01759v3","paper_title":"Bag of Tricks for Efficient Text Classification","code":"https://github.com/facebookresearch/fastText","n_code_links":65,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":2}},{"rank_in_archive_order":18,"model":"LEAM","metrics":{"Error":"4.69"},"uses_additional_data":false,"paper_date":"2018-05-10","paper":"/paper/joint-embedding-of-words-and-labels-for-text","paper_url":"http://arxiv.org/abs/1805.04174v1","paper_title":"Joint Embedding of Words and Labels for Text Classification","code":"https://github.com/guoyinwang/LEAM","n_code_links":2,"syntology":null},{"rank_in_archive_order":19,"model":"SVDCNN","metrics":{"Error":"4.74"},"uses_additional_data":false,"paper_date":"2019-01-28","paper":"/paper/squeezed-very-deep-convolutional-neural","paper_url":"http://arxiv.org/abs/1901.09821v1","paper_title":"Squeezed Very Deep Convolutional Neural Networks for Text Classification","code":"https://github.com/lazarotm/SVDCNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"Char-level CNN","metrics":{"Error":"4.88"},"uses_additional_data":false,"paper_date":"2015-09-04","paper":"/paper/character-level-convolutional-networks-for","paper_url":"http://arxiv.org/abs/1509.01626v3","paper_title":"Character-level Convolutional Networks for Text Classification","code":"https://github.com/makcedward/nlpaug","n_code_links":30,"syntology":{"n_ran":4,"n_unverified":16,"n_samples":20,"n_pointer_only_licence":5}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":9,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":7,"samples_over_distinct_papers":{"n_ran":42,"n_unverified":89,"n_samples":131,"n_pointer_only_licence":27,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":63,"n_unverified":138,"n_samples":201,"n_pointer_only_licence":41,"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"}}}