{"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":"/paper/bidirectional-recurrent-models-for-offensive","title":"Bidirectional Recurrent Models for Offensive Tweet Classification","arxiv_id":"1903.08808","date":"2019-03-19","proceeding":null,"authors":["Aleix Cambray","Norbert Podsadowski"],"abstract":"In this paper we propose four deep recurrent architectures to tackle the task\nof offensive tweet detection as well as further classification into targeting\nand subject of said targeting. Our architectures are based on LSTMs and GRUs,\nwe present a simple bidirectional LSTM as a baseline system and then further\nincrease the complexity of the models by adding convolutional layers and\nimplementing a split-process-merge architecture with LSTM and GRU as\nprocessors. Multiple pre-processing techniques were also investigated. The\nvalidation F1-score results from each model are presented for the three\nsubtasks as well as the final F1-score performance on the private competition\ntest set. It was found that model complexity did not necessarily yield better\nresults. Our best-performing model was also the simplest, a bidirectional LSTM;\nclosely followed by a two-branch bidirectional LSTM and GRU architecture.","url_abs":"http://arxiv.org/abs/1903.08808v1","url_pdf":"http://arxiv.org/pdf/1903.08808v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"bidirectional-recurrent-models-for-offensive","repo_url":"https://github.com/Nadhila/Explainble-AI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"bidirectional-recurrent-models-for-offensive","repo_url":"https://github.com/acambray/SemEval2019-OffensiveTweetClassification","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"gru","method_name":"GRU"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Nadhila/Explainble-AI","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"acambray/SemEval2019-OffensiveTweetClassification","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c9e922aa153d409b6d406cb354fc612d34d44a5d2c9d0544c427493a20e73968","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}