gabski/deberta-suboptimal-claim-detection

Model

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

Suboptimal Claim Detection

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.

Usage

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)