{"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/colbert-using-bert-sentence-embedding-for","title":"ColBERT: Using BERT Sentence Embedding in Parallel Neural Networks for Computational Humor","arxiv_id":"2004.12765","date":"2020-04-27","proceeding":null,"authors":["Issa Annamoradnejad","Gohar Zoghi"],"abstract":"Automation of humor detection and rating has interesting use cases in modern technologies, such as humanoid robots, chatbots, and virtual assistants. In this paper, we propose a novel approach for detecting and rating humor in short texts based on a popular linguistic theory of humor. The proposed technical method initiates by separating sentences of the given text and utilizing the BERT model to generate embeddings for each one. The embeddings are fed to separate lines of hidden layers in a neural network (one line for each sentence) to extract latent features. At last, the parallel lines are concatenated to determine the congruity and other relationships between the sentences and predict the target value. We accompany the paper with a novel dataset for humor detection consisting of 200,000 formal short texts. In addition to evaluating our work on the novel dataset, we participated in a live machine learning competition focused on rating humor in Spanish tweets. The proposed model obtained F1 scores of 0.982 and 0.869 in the humor detection experiments which outperform general and state-of-the-art models. The evaluation performed on two contrasting settings confirm the strength and robustness of the model and suggests two important factors in achieving high accuracy in the current task: 1) usage of sentence embeddings and 2) utilizing the linguistic structure of humor in designing the proposed model.","url_abs":"https://arxiv.org/abs/2004.12765v7","url_pdf":"https://arxiv.org/pdf/2004.12765v7.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":"colbert-using-bert-sentence-embedding-for","repo_url":"https://github.com/Moradnejad/ColBERT-Using-BERT-Sentence-Embedding-for-Humor-Detection","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"colbert-using-bert-sentence-embedding-for","repo_url":"https://github.com/punitMashruwala/Detecting_Humor","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"colbert-using-bert-sentence-embedding-for","repo_url":"https://github.com/yalsaffar/S-COLBERT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"colbert-using-bert-sentence-embedding-for","repo_url":"https://github.com/huggingface/transformers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"humor-detection","task_name":"Humor Detection"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-embedding","task_name":"Sentence Embedding"},{"task_slug":"sentence-embeddings","task_name":"Sentence Embeddings"},{"task_slug":"sentence-embedding-1","task_name":"Sentence-Embedding"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"attention-dropout","method_name":"Attention Dropout"},{"method_slug":"bert","method_name":"BERT"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"linear-warmup-with-linear-decay","method_name":"Linear Warmup With Linear Decay"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"weight-decay","method_name":"Weight Decay"},{"method_slug":"wordpiece","method_name":"WordPiece"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/humor-detection-on-200k-short-texts-for-humor-1","task":"Humor Detection","dataset":"200k Short Texts for Humor Detection","model":"ColBERT model","rank_in_archive_order":1,"of":6,"metrics":{"F1-score":"0.982"},"uses_additional_data":false},{"leaderboard":"/sota/humor-detection-on-200k-short-texts-for-humor-1","task":"Humor Detection","dataset":"200k Short Texts for Humor Detection","model":"Multinomial NB","rank_in_archive_order":3,"of":6,"metrics":{"F1-score":"0.882"},"uses_additional_data":false},{"leaderboard":"/sota/humor-detection-on-200k-short-texts-for-humor-1","task":"Humor Detection","dataset":"200k Short Texts for Humor Detection","model":"SVM","rank_in_archive_order":4,"of":6,"metrics":{"F1-score":"0.874"},"uses_additional_data":false},{"leaderboard":"/sota/humor-detection-on-200k-short-texts-for-humor-1","task":"Humor Detection","dataset":"200k Short Texts for Humor Detection","model":"Decision Tree","rank_in_archive_order":6,"of":6,"metrics":{"F1-score":"0.794"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2004.12765","atlas_url":"https://app.syntology.ai/?focus=2004.12765","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2004.12765"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2004.12765\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2004.12765"},"call":"get_concepts_for_paper(arxiv_id=\"2004.12765\")"}],"by_repo":[{"repo":"Moradnejad/ColBERT-Using-BERT-Sentence-Embedding-for-Humor-Detection","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"punitMashruwala/Detecting_Humor","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yalsaffar/S-COLBERT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"huggingface/transformers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1706.03762","1910.03771","2006.03654","2010.01057"],"harvested_for_calls":[{"arxiv_id":"1706.03762","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.03762"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.03762\")"},{"arxiv_id":"1910.03771","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.03771"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.03771\")"},{"arxiv_id":"2006.03654","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.03654"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.03654\")"},{"arxiv_id":"2010.01057","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.01057"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.01057\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"5c1693cf061c80f39bfe2bf6d716aada1e3e480fb05a8ebd9556f9e9b2c6978c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}