Downloads · 30 days
20
5% of all-time downloads
gabski/deberta-suboptimal-claim-detection
deberta-suboptimal-claim-detection is a text classification model from gabski. Use it when you need a label for a piece of text. It is set up for transformers. The card lists the license as cc-by-nc-sa-4.0.
This model was obtained by fine-tuning microsoft/deberta-base on the extended ClaimRev dataset.
Downloads · 30 days
20
5% of all-time downloads
All-time downloads
371
Public
Repo size
1.1 GB
Likes
0
Public
Click a slice to open those files.
.bin557 MB · 100%
From the Hugging Face model README
This model was obtained by fine-tuning microsoft/deberta-base on the extended ClaimRev dataset.
Paper: To Revise or Not to Revise: Learning to Detect Improvable Claims for Argumentative Writing Support
Authors: Gabriella Skitalinskaya and Henning Wachsmuth
We cast this task as a binary classification task, where the objective is, given an argumentative claim, to decide whether it is in need of further revision or can be considered to be phrased more or less optimally.
from transformers import AutoTokenizer, AutoModelForSequenceClassification
import torch
tokenizer = AutoTokenizer.from_pretrained("gabski/deberta-suboptimal-claim-detection")
model = AutoModelForSequenceClassification.from_pretrained("gabski/deberta-suboptimal-claim-detection")
claim = 'Teachers are likely to educate children better than parents.'
model_input = tokenizer(claim, return_tensors='pt')
model_outputs = model(**model_input)
outputs = torch.nn.functional.softmax(model_outputs.logits, dim = -1)
print(outputs)