Downloads · 30 days
92
9% of all-time downloads
loyoladatamining/is_pay
is_pay is a text classification model from loyoladatamining. Use it when you need a label for a piece of text. The card lists the license as mit.
ispay is a fine-tuned, lightweight sequence classification model used to predict whether a given text string contains wage or salary information. It was fine-tuned from lyeonii/bert-tiny, making it highly efficient fo…
Downloads · 30 days
92
9% of all-time downloads
All-time downloads
972
Public
Parameters
4.4M
17.6 MB on disk
Likes
0
Public
Click a slice to open those files.
.safetensors17.5 MB · 95%
From the Hugging Face model README
is_pay is a fine-tuned, lightweight sequence classification model used to predict whether a given text string contains wage or salary information. It was fine-tuned from lyeonii/bert-tiny, making it highly efficient for high-throughput filtering pipelines.
You can deploy this model using the standard Hugging Face text-classification pipeline.
from transformers import pipeline, AutoModelForSequenceClassification, AutoTokenizer
model_name = "loyoladatamining/is_pay"
model = AutoModelForSequenceClassification.from_pretrained(model_name)
tokenizer = AutoTokenizer.from_pretrained(model_name, max_length=64, truncation=True)
# Create text classification pipeline
nlp = pipeline(
"text-classification",
model=model,
tokenizer=tokenizer,
max_length=64,
truncation=True
)
# Inference
text = "The starting salary for this position is $75,000 per year."
result = nlp(text)
print(result)
The model returns a list containing a dictionary with the predicted binary class label and its corresponding confidence score:
[
{
"label": "LABEL_1",
"score": 0.9942
}
]
LABEL_0: The text does not contain wage or salary information.LABEL_1: The text contains wage or salary information.If you find is_pay useful in your work, please consider citing:
@article{meisenbacher2025extracting,
title={Extracting O* NET Features from the NLx Corpus to Build Public Use Aggregate Labor Market Data},
author={Meisenbacher, Stephen and Nestorov, Svetlozar and Norlander, Peter},
year={2025}
}