Browse State-of-the-Art › Binary text classification
Binary text classification
12 papers with code · 7 benchmarks · 10 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
7 leaderboard tables shown for this task, 7 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| Ghostbuster (All Domains) (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| MAGE (Arbitrary-domains & Arbitrary-models) (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| MixSet (Binary) (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| TURINGBENCH (Turing Test, GPT-3) (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| TURINGBENCH (Turing Test, FAIR_wmt20) (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| TweepFake (2 rows) | GigaCheck (Mistral-7B) | GigaCheck: Detecting LLM-generated Content | — | — | Compare |
| ECHR Non-Anonymized (1 row) | HIER-BERT | Neural Legal Judgment Prediction in English | — | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
10 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
1 subtask in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 20 · with a code link: 12 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (3 of 20 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 20 of 20, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
27 Sep 2021 3 repositories listed Syntology 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples)Recent progress in generative language models has enabled machines to generate astonishingly realistic texts.
-
11 Jan 2024 2 repositories listed Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 8 unverified (of 16 harvested samples) · 16 pointer-only (licence)With the rapid development and widespread application of Large Language Models (LLMs), the use of Machine-Generated Text (MGT) has become increasingly common, bringing with it potential risks, especially in terms of…
-
8 Jun 2023 2 repositories listedIn this article, we present DACCORD, a new dataset dedicated to the task of automatically detecting contradictions between sentences in French.
-
24 May 2023 2 repositories listedIn conjunction with our model, we release three new datasets of human- and AI-generated text as detection benchmarks in the domains of student essays, creative writing, and news articles.
-
22 May 2023 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)In practical scenarios, however, the detector faces texts from various domains or LLMs without knowing their sources.
-
20 Jul 2018 2 repositories listedThe disambiguation is formulated as a binary text classification problem where the prediction is made for the potential soft skill based on the context where it occurs.
-
1 Dec 2014 2 repositories listedUsing online EP and the central limit theorem we find an analytical approximation to the Bayes update of this posterior, as well as the resulting Bayes estimates of the weights and outputs.
-
3 May 2024 1 repository listedHoaxes are a recognised form of disinformation created deliberately, with potential serious implications in the credibility of reference knowledge resources such as Wikipedia.
-
Identification of the Relevance of Comments in Codes Using Bag of Words and Transformer Based Models11 Aug 2023 1 repository listedThe performance of the classical bag of words model and transformer-based models were explored to identify significant features from the given training corpus.
-
1 Nov 2020 1 repository listedHere, we present a large-scale empirical study on active learning techniques for BERT-based classification, addressing a diverse set of AL strategies and datasets.
-
31 Jul 2020 1 repository listedTo prevent this, it is crucial to develop deepfake social media messages detection systems.
-
12 Sep 2019 1 repository listedShallow machine learning strategies showed lower overall micro F1 scores, but still higher than deep learning strategies and the baseline.
-
Reliable Decision Support with LLMs: A Framework for Evaluating Consistency in Binary Text Classification Applications20 May 2025 0 repositories listedThis study introduces a framework for evaluating consistency in large language model (LLM) binary text classification, addressing the lack of established reliability assessment methods.
-
31 Oct 2024 0 repositories listedWith the increasing quality and spread of LLM-based assistants, the amount of LLM-generated content is growing rapidly.
-
Calibrated Large Language Models for Binary Question Answering1 Jul 2024 0 repositories listedQuantifying the uncertainty of predictions made by large language models (LLMs) in binary text classification tasks remains a challenge.
-
Analyzing the Generalizability of Deep Contextualized Language Representations For Text Classification22 Mar 2023 0 repositories listedThis study evaluates the robustness of two state-of-the-art deep contextual language representations, ELMo and DistilBERT, on supervised learning of binary protest news classification and sentiment analysis of product…
-
Argumentative Explanations for Pattern-Based Text Classifiers22 May 2022 0 repositories listedRecent works in Explainable AI mostly address the transparency issue of black-box models or create explanations for any kind of models (i.e., they are model-agnostic), while leaving explanations of interpretable models…
-
CIA_NITT at WNUT-2020 Task 2: Classification of COVID-19 Tweets Using Pre-trained Language Models12 Sep 2020 0 repositories listedThis paper presents our models for WNUT 2020 shared task2.
-
5 Jun 2019 0 repositories listedLegal judgment prediction is the task of automatically predicting the outcome of a court case, given a text describing the case's facts.
-
Deception Detection for the Russian Language: Lexical and Syntactic Parameters1 Sep 2017 0 repositories listedThe field of automated deception detection in written texts is methodologically challenging.
Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections