Back to all models
text-classification mask_token: [MASK]
Query this model
🔥 This model is currently loaded and running on the Inference API. ⚠️ This model could not be loaded by the inference API. ⚠️ This model can be loaded on the Inference API on-demand.
JSON Output
API endpoint
Share

iarfmoose/bert-base-cased-qa-evaluator
last 30 days

pytorch

tf

#### Contributed by

How to use this model directly from the 🤗/transformers library:


from transformers import AutoTokenizer, AutoModelForSequenceClassification

tokenizer = AutoTokenizer.from_pretrained("iarfmoose/bert-base-cased-qa-evaluator")

model = AutoModelForSequenceClassification.from_pretrained("iarfmoose/bert-base-cased-qa-evaluator")


Update on GitHub

# BERT-base-cased-qa-evaluator

This model takes a question answer pair as an input and outputs a value representing its prediction about whether the input was a valid question and answer pair or not. The model is a pretrained BERT-base-cased with a sequence classification head.

## Intended uses

The QA evaluator was originally designed to be used with the t5-base-question-generator for evaluating the quality of generated questions.

The input for the QA evaluator follows the format for BertForSequenceClassification, but using the question and answer as the two sequences. Inputs should take the following format:

[CLS] <question> [SEP] <answer [SEP]

## Limitations and bias

The model is trained to evaluate if a question and answer are semantically related, but cannot determine whether an answer is actually true/correct or not.

## Training data

The training data was made up of question-answer pairs from the following datasets:

## Training procedure

The question and answer were concatenated 50% of the time. In the other 50% of the time a corruption operation was performed (either swapping the answer for an unrelated answer, or by copying part of the question into the answer). The model was then trained to predict whether the input sequence represented one of the original QA pairs or a corrupted input.